Sciweavers

4255 search results - page 81 / 851
» Cover
Sort
View
125
Voted
ICCS
2003
Springer
15 years 7 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...
WEA
2010
Springer
250views Algorithms» more  WEA 2010»
15 years 7 months ago
Randomized Rounding for Routing and Covering Problems: Experiments and Improvements
We investigate how the recently developed different approaches to generate randomized roundings satisfying disjoint cardinality constraints behave when used in two classical algori...
Benjamin Doerr, Marvin Künnemann, Magnus Wahl...
FCCM
2002
IEEE
131views VLSI» more  FCCM 2002»
15 years 7 months ago
Custom Computing Machines for the Set Covering Problem
Christian Plessl, Marco Platzner
DATE
2000
IEEE
114views Hardware» more  DATE 2000»
15 years 6 months ago
On Using Satisfiability-Based Pruning Techniques in Covering Algorithms
Vasco M. Manquinho, João P. Marques Silva