Sciweavers

1040 search results - page 12 / 208
» Rounding algorithms for covering problems
Sort
View
ALGORITHMICA
2008
59views more  ALGORITHMICA 2008»
13 years 7 months ago
An Optimal Algorithm for the Minimum Disc Cover Problem
Min-Te Sun, Chih-Wei Yi, Chuan-Kai Yang, Ten-Hwang...
JCSS
2006
51views more  JCSS 2006»
13 years 7 months ago
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Gilles Geeraerts, Jean-François Raskin, Lau...
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
14 years 1 months ago
The Minimum Substring Cover Problem
Danny Hermelin, Dror Rawitz, Romeo Rizzi, St&eacut...
ESA
2006
Springer
88views Algorithms» more  ESA 2006»
13 years 11 months ago
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
Christoph Ambühl, Monaldo Mastrolilli