414 search results - page 9 / 83 » An Approximation Algorithm for the Minimum Latency Set Cover... |
COCOON
2010
Springer
14 years 26 days ago
2010
Springer
APPROX
2008
Springer
13 years 10 months ago
2008
Springer
We study the directed minimum latency problem: given an n-vertex asymmetric metric (V, d) with a root vertex r V , find a spanning path originating at r that minimizes the sum of...
DCOSS
2008
Springer
13 years 10 months ago
2008
Springer
We present the first local approximation schemes for maximum independent set and minimum vertex cover in unit disk graphs. In the graph model we assume that each node knows its geo...
FOCS
2003
IEEE
14 years 1 months ago
2003
IEEE
We give improved approximation algorithms for a variety of latency minimization problems. In particular, we give a 3.591 -approximation to the minimum latency problem, improving o...
IPL
2008
13 years 8 months ago
2008
The Positive-Negative Partial Set Cover problem is introduced and its complexity, especially the hardness-of-approximation, is studied. The problem generalizes the Set Cover probl...