201 search results - page 4 / 41 » The Minimum Substring 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...
FOCS
2009
IEEE
14 years 2 months ago
2009
IEEE
Abstract— We give approximation algorithms for the Generalized Steiner Network (GSN) problem. The input consists of a graph
APPROX
2006
Springer
13 years 11 months ago
2006
Springer
ALGORITHMICA
2008
13 years 7 months ago
2008
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...