Sciweavers

1040 search results - page 11 / 208
» Rounding algorithms for covering problems
Sort
View
FSTTCS
2004
Springer
14 years 27 days ago
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
Gilles Geeraerts, Jean-François Raskin, Lau...
COCOON
2010
Springer
13 years 11 months ago
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
Piotr Berman, Marek Karpinski, Andrzej Lingas
ALENEX
2004
99views Algorithms» more  ALENEX 2004»
13 years 9 months ago
Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments
d Abstract) Faisal N. Abu-Khzam , Rebecca L. Collins , Michael R. Fellows , Michael A. Langston , W. Henry Suters and Chris T. Symons
Faisal N. Abu-Khzam, Rebecca L. Collins, Michael R...