216 search results - page 4 / 44 » Covering Problems with Hard Capacities |
ICALP
2010
Springer
14 years 8 days 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...
COCO
2004
Springer
13 years 11 months ago
2004
Springer
We initiate the study of the computational complexity of the covering radius problem for point lattices, and approximation versions of the problem for both lattices and linear cod...
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
In this paper, we propose the combination of different optimization techniques in order to solve “hard” two- and threeobjective optimization problems at a relatively low comp...
FSTTCS
2003
Springer
14 years 21 days ago
2003
Springer
The Covering Steiner problem is a common generalization of the k-MST and Group Steiner problems. An instance of the Covering Steiner problem consists of an undirected graph with ed...
JDA
2008
13 years 7 months ago
2008
Set Cover problems are of core importance in many applications. In recent research, the "red-blue variants" where blue elements all need to be covered whereas red elemen...