Sciweavers

1040 search results - page 12 / 208
» Rounding algorithms for covering problems
Sort
View
ALGORITHMICA
2008
59views more  ALGORITHMICA 2008»
15 years 3 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»
15 years 3 months ago
Expand, Enlarge and Check: New algorithms for the coverability problem of WSTS
Gilles Geeraerts, Jean-François Raskin, Lau...
80
Voted
NETWORKS
2007
15 years 2 months ago
A linear-time algorithm for the k-fixed-endpoint path cover problem on cographs
Katerina Asdre, Stavros D. Nikolopoulos
WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
15 years 9 months ago
The Minimum Substring Cover Problem
Danny Hermelin, Dror Rawitz, Romeo Rizzi, St&eacut...
111
Voted
ESA
2006
Springer
88views Algorithms» more  ESA 2006»
15 years 7 months ago
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem
Christoph Ambühl, Monaldo Mastrolilli