3874 search results - page 514 / 775 » Approximation Algorithms for k-hurdle Problems |
140
click to vote
COMPGEOM
2006
ACM
15 years 10 months ago
2006
ACM
We consider a class of geometric facility location problems in which the goal is to determine a set X of disks given by their centers (tj) and radii (rj) that cover a given set of...
143
Voted
ICALP
2005
Springer
15 years 10 months ago
2005
Springer
Abstract. This paper considers the Steiner tree problem in the model of twostage stochastic optimization with recourse. This model, the focus of much recent research [1–4], tries...
143
click to vote
DIALM
2003
ACM
15 years 10 months ago
2003
ACM
We consider the problem of maximizing the lifetime of a given multicast connection in a wireless network of energyconstrained (e.g. battery-operated) nodes, by choosing ideal tran...
130
click to vote
ICML
2006
IEEE
16 years 5 months ago
2006
IEEE
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
149
click to vote
WWW
2005
ACM
16 years 5 months ago
2005
ACM
We exploit the recently proposed Concept Abduction inference service in Description Logics to solve Concept Covering problems. We propose a framework and polynomial greedy algorit...