173 search results - page 9 / 35 » Complexity and Approximation Results for the Connected Verte... |
COCO
2004
Springer
14 years 13 days 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...
FSTTCS
2009
Springer
14 years 3 months ago
2009
Springer
In this paper, we initiate the study of designing approximation algorithms for FaultTolerant Group-Steiner (FTGS) problems. The motivation is to protect the well-studied group-Ste...
FOCS
2005
IEEE
14 years 2 months ago
2005
IEEE
Robust optimization has traditionally focused on uncertainty in data and costs in optimization problems to formulate models whose solutions will be optimal in the worstcase among ...
ESA
2001
Springer
14 years 1 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
ESA
2006
Springer
14 years 11 days ago
2006
Springer
An instance of the generalized partial cover problem consists of a ground set U and a family of subsets S 2U . Each element e U is associated with a profit p(e), whereas each su...