26 search results - page 3 / 6 » Better and Simpler Approximation Algorithms for the Stable M... |
COMPGEOM
2007
ACM
13 years 9 months ago
2007
ACM
We illustrate a simple algorithm for approximating the medial axis of a 2D shape with smooth boundary from a sample of this boundary. The algorithm is compared to a more general a...
COCOA
2008
Springer
13 years 7 months ago
2008
Springer
This paper deals with approximation algorithms for the prize collecting generalized Steiner forest problem, defined as follows. The input is an undirected graph G = (V, E), a colle...
SODA
2008
ACM
13 years 7 months ago
2008
ACM
Local ratio is a well-known paradigm for designing approximation algorithms for combinatorial optimization problems. At a very high level, a local-ratio algorithm first decomposes ...
ICCV
1999
IEEE
13 years 10 months ago
1999
IEEE
This paper presents a first investigation on the structure from motion problem from the combination of full and weak perspective images. This problem arises in multiresolution obj...
ISPD
1997
ACM
13 years 10 months ago
1997
ACM
The wire sizing problem under inequality Elmore delay constraints is known to be posynomial, hence convex under an exponential variable-transformation. There are formal methods fo...