1566 search results - page 21 / 314 » On a Cone Covering Problem |
149
click to vote
COCO
2004
Springer
15 years 9 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...
STOC
2003
ACM
16 years 5 months ago
2003
ACM
144
click to vote
GECCO
2007
Springer
15 years 11 months ago
2007
Springer
The main aim of randomized search heuristics is to produce good approximations of optimal solutions within a small amount of time. In contrast to numerous experimental results, th...
206
click to vote
MST
2011
15 years 20 hour ago
2011
Abstract. We study the well-known Vertex Cover problem parameterized above and below tight bounds. We show that two of the parameterizations (both were suggested by Mahajan, Raman ...
135
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
The input to the minimum latency set cover problem (MLSC) consists of a set of jobs and a set of tools. Each job j needs a specific subset Sj of the tools in order to be processed...