1040 search results - page 75 / 208 » Rounding algorithms for covering problems |
ICALP
2005
Springer
15 years 5 months ago
2005
Springer
We define an algorithmic paradigm, the stack model, that captures many primal-dual and local-ratio algorithms for approximating covering and packing problems. The stack model is ...
INFOCOM
2007
IEEE
15 years 6 months ago
2007
IEEE
— Unlike convectional omni-directional sensors that always have an omni-angle of sensing range, directional sensors may have a limited angle of sensing range due to technical con...
APPROX
2004
Springer
15 years 5 months ago
2004
Springer
We study a variant of the maximum coverage problem which we label the maximum coverage problem with group budget constraints (MCG). We are given a collection of sets S = {S1, S2, ....
114
click to vote
WDAG
2010
Springer
14 years 10 months ago
2010
Springer
Abstract. Since in general it is NP-hard to solve the minimum dominating set problem even approximatively, a lot of work has been dedicated to central and distributed approximation...
106
click to vote
DAM
2010
14 years 12 months ago
2010
For all integers k 3, we give an O(n4 ) time algorithm for the problem whose instance is a graph G of girth at least k together with k vertices and whose question is "Does G...