Sciweavers

69 search results - page 1 / 14
» Near-Linear Time Approximation Algorithms for Curve Simplifi...
Sort
View
ALGORITHMICA
2005
95views more  ALGORITHMICA 2005»
13 years 5 months ago
Near-Linear Time Approximation Algorithms for Curve Simplification
Abstract. We consider the problem of approximating a polygonal curve
Pankaj K. Agarwal, Sariel Har-Peled, Nabil H. Must...
SODA
2000
ACM
109views Algorithms» more  SODA 2000»
13 years 6 months ago
Approximate congruence in nearly linear time
Piotr Indyk, Suresh Venkatasubramanian
WADS
2005
Springer
111views Algorithms» more  WADS 2005»
13 years 10 months ago
Near-Optimal Pricing in Near-Linear Time
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 ...
Jason D. Hartline, Vladlen Koltun
WADS
2007
Springer
165views Algorithms» more  WADS 2007»
13 years 11 months ago
A Near Linear Time Approximation Scheme for Steiner Tree Among Obstacles in the Plane
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...
Matthias Müller-Hannemann, Siamak Tazari
SIAMCOMP
1998
124views more  SIAMCOMP 1998»
13 years 5 months ago
Near-Linear Time Construction of Sparse Neighborhood Covers
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)...
Baruch Awerbuch, Bonnie Berger, Lenore Cowen, Davi...