Sciweavers

1040 search results - page 75 / 208
» Rounding algorithms for covering problems
Sort
View
ICALP
2005
Springer
15 years 3 months ago
How Well Can Primal-Dual and Local-Ratio Algorithms Perform?
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 ...
Allan Borodin, David Cashman, Avner Magen
INFOCOM
2007
IEEE
15 years 4 months ago
Target-Oriented Scheduling in Directional Sensor Networks
— 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...
Yanli Cai, Wei Lou, Minglu Li, X.-Y. Li
APPROX
2004
Springer
122views Algorithms» more  APPROX 2004»
15 years 3 months ago
Maximum Coverage Problem with Group Budget Constraints and Applications
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, ....
Chandra Chekuri, Amit Kumar
WDAG
2010
Springer
233views Algorithms» more  WDAG 2010»
14 years 8 months ago
Minimum Dominating Set Approximation in Graphs of Bounded Arboricity
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...
Christoph Lenzen, Roger Wattenhofer
DAM
2010
81views more  DAM 2010»
14 years 10 months ago
The k-in-a-tree problem for graphs of girth at least k
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...
W. Liu, Nicolas Trotignon