Sciweavers

1433 search results - page 23 / 287
» On Covering Problems of Rado
Sort
View
ICCS
2003
Springer
15 years 5 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»
15 years 4 months ago
Custom Computing Machines for the Set Covering Problem
Christian Plessl, Marco Platzner
COCOON
2010
Springer
15 years 4 months ago
Exact and Approximation Algorithms for Geometric and Capacitated Set Cover Problems
Piotr Berman, Marek Karpinski, Andrzej Lingas
IFIP
1999
Springer
15 years 4 months ago
Aura II: Combining Negative Thinking and Branch-and-Bound in Unate Covering Problems
Luca P. Carloni, Evguenii I. Goldberg, Tiziano Vil...
WG
1994
Springer
15 years 3 months ago
Complexity of Graph Covering Problems
Jan Kratochvíl, Andrzej Proskurowski, Jan A...