219 search results - page 16 / 44 » A Better Approximation Ratio for the Vertex Cover Problem |
MFCS
2009
Springer
14 years 1 days ago
2009
Springer
We present a simple algorithm for the maximum spanning star forest problem. We take advantage of the fact that the problem is a special case of complementary set cover and we adapt...
RANDOM
2001
Springer
13 years 12 months ago
2001
Springer
We discuss two approximation approaches, the primal-dual schema and the local-ratio technique. We present two relatively simple frameworks, one for each approach, which extend know...
CORR
2006
Springer
13 years 7 months ago
2006
Springer
Suppose we are given a set of objects that cover a region and a duration associated with each object. Viewing the objects as jobs, can we schedule their beginning times to maximiz...
MFCS
2009
Springer
14 years 2 months ago
2009
Springer
We investigate the computational complexity of a general “compression task” centrally occurring in the recently developed technique of iterative compression for exactly solving...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...