69 search results - page 1 / 14 » Near-Linear Time Approximation Algorithms for Curve Simplifi... |
ALGORITHMICA
2005
13 years 5 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve
SODA
2000
ACM
13 years 6 months ago
2000
ACM
WADS
2005
Springer
13 years 10 months ago
2005
Springer
We present efficient approximation algorithms for a number of problems that call for computing the prices that maximize the revenue of the seller on a set of items. Algorithms for ...
WADS
2007
Springer
13 years 11 months ago
2007
Springer
We present a polynomial-time approximation scheme (PTAS) for the Steiner tree problem with polygonal obstacles in the plane with running time O(n log2 n), where n denotes the numb...
SIAMCOMP
1998
13 years 4 months ago
1998
This paper introduces a near-linear time sequential algorithm for constructing a sparse neighborhood cover. This implies analogous improvements (from quadratic to near-linear time)...