Sciweavers

WAOA
2007
Springer
109views Algorithms» more  WAOA 2007»
13 years 11 months ago
The Minimum Substring Cover Problem
Danny Hermelin, Dror Rawitz, Romeo Rizzi, St&eacut...
WAOA
2007
Springer
126views Algorithms» more  WAOA 2007»
13 years 11 months ago
Better Bounds for Incremental Medians
In the incremental version of the well-known k-median problem the objective is to compute an incremental sequence of facility sets F1 ⊆ F2 ⊆ .... ⊆ Fn, where each Fk contain...
Marek Chrobak, Mathilde Hurand
WAOA
2007
Springer
92views Algorithms» more  WAOA 2007»
13 years 11 months ago
Geometric Spanners with Small Chromatic Number
Prosenjit Bose, Paz Carmi, Mathieu Couture, Anil M...