1424 search results - page 10 / 285 » The Multi-radius Cover Problem |
172
Voted
ICDT
2005
ACM
15 years 11 months ago
2005
ACM
Abstract. A classical problem in query optimization is to find the optimal ordering of a set of possibly correlated selections. We provide an ion of this problem as a generalizati...
173
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
In this paper, we study the following disc covering problem: Given a set of discs of various radii on the plane, find a subset of discs to maximize the area covered by exactly on...
160
click to vote
CEC
2008
IEEE
16 years 9 days ago
2008
IEEE
— Recently it has been proved that the (1+1)-EA produces poor worst-case approximations for the vertex cover problem. In this paper the result is extended to the (1+λ)-EA by pro...
155
Voted
COMBINATORICS
2006
15 years 5 months ago
2006
Consider the symmetric group Sn equipped with the Hamming metric dH . Packing and covering problems in the finite metric space (Sn, dH ) are surveyed, including a combination of b...
162
Voted
ICALP
2010
Springer
15 years 10 months ago
2010
Springer
Assuming the Unique Games Conjecture (UGC), we show optimal inapproximability results for two classic scheduling problems. We obtain a hardness of 2 − ε for the problem of mini...