Sciweavers

1671 search results - page 45 / 335
» On the Covering Steiner Problem
Sort
View
FSTTCS
2004
Springer
14 years 4 months ago
Expand, Enlarge, and Check: New Algorithms for the Coverability Problem of WSTS
Gilles Geeraerts, Jean-François Raskin, Lau...
ICCS
2003
Springer
14 years 4 months ago
Approximation Algorithms to Minimum Vertex Cover Problems on Polygons and Terrains
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...
Ana Paula Tomás, António Leslie Baju...
FCCM
2002
IEEE
131views VLSI» more  FCCM 2002»
14 years 4 months ago
Custom Computing Machines for the Set Covering Problem
Christian Plessl, Marco Platzner
COCOON
2010
Springer
14 years 3 months ago
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
Piotr Berman, Marek Karpinski, Andrzej Lingas