Lower bound for sparse Euclidean spanners

Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms

Volumn , Issue , 2005, Pages 670-671

  Agarwal, Pankaj K ^a   Wang, Yusu ^a   Yin, Peng ^a  

^a Duke University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

GRAPH THEORY; OPTIMIZATION; PROBLEM SOLVING; SET THEORY; THEOREM PROVING;

LOWER BOUNDS; MINIMUM LINK PATH; ONE-DIMENSIONAL GRAPH PROBLEMS; SPARSE EUCLIDEAN SPANNERS;

BOUNDARY VALUE PROBLEMS;

EID: 20744459270     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (4)

1. S. Arya, O. Das, D. M. Mount, J. S. Salowe, and M. Smid. Euclidean spanners: Short, thin and lanky. P roc. 27th Ann. ACM Sympos. Theo. Comput., 1995, 489-498.
2. B. Chazelle and B. Rosenberg. The complexity of computing partial sums off-line, Int. J. Comput. Geom. Appl., 1(1991), 33-45.
3. M. Pǎtraşcu and E. D. Demaine. Tight bounds for the partialsums problem. Proc. 15th Ann. ACM-SIAM Sympos. Discrete Algorithms, 2004, 20-29.
4. A. C. Yao. Space-time tradeoff for answering range queries. Proc. 14th Ann. ACM Sympos. Theo. Comput., 1982, 128-136.