80 search results - page 9 / 16 » A simple local 3-approximation algorithm for vertex cover |
COMPGEOM
1999
ACM
14 years 7 days ago
1999
ACM
We wish to extract the topology from scanned maps. In previous work [15] this was done by extracting a skeleton from the Voronoi diagram, but this required vertex labelling and wa...
COMPGEOM
2008
ACM
13 years 9 months ago
2008
ACM
Anisotropic meshes are triangulations of a given domain in the plane or in higher dimensions, with elements elongated along prescribed directions. Anisotropic triangulations have ...
IPCO
2007
13 years 9 months ago
2007
Following the well-studied two-stage optimization framework for stochastic optimization [15, 18], we study approximation algorithms for robust two-stage optimization problems with ...
SOFSEM
1997
Springer
14 years 2 days ago
1997
Springer
This paper surveys recent results in the area of virtual path layout in ATM networks. We present a model for the theoretical study of these layouts the model amounts to covering t...
CVPR
2010
IEEE
14 years 4 months ago
2010
IEEE
Object localization in an image is usually handled by searching for an optimal subwindow that tightly covers the object of interest. However, the subwindows considered in previous ...