969 search results - page 6 / 194 » An Optimal Algorithm for the Minimum Disc Cover Problem |
ICCS
2003
Springer
14 years 18 days ago
2003
Springer
We propose an anytime algorithm to compute successively better approximations of the optimum of Minimum Vertex Guard. Though the presentation is focused on polygons, the work may b...
WAOA
2007
Springer
14 years 1 months ago
2007
Springer
GECCO
2007
Springer
14 years 1 months ago
2007
Springer
ESA
2010
Springer
13 years 7 months ago
2010
Springer
Abstract. Minimizing the makespan or maximizing the minimum machine load are two of the most important and fundamental parallel machine scheduling problems. In an online scenario, ...
ICALP
2001
Springer
13 years 12 months ago
2001
Springer
We study the generalization of covering problems to partial covering. Here we wish to cover only a desired number of elements, rather than covering all elements as in standard cov...