46 search results - page 1 / 10 » Approximate congruence in nearly linear time |
SODA
2000
ACM
14 years 7 days ago
2000
ACM
WADS
2005
Springer
14 years 4 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
14 years 5 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...
ALGORITHMICA
2005
13 years 10 months ago
2005
Abstract. We consider the problem of approximating a polygonal curve
FOCS
2010
IEEE
13 years 9 months ago
2010
IEEE
