Minimum dilation stars

Proceedings of the Annual Symposium on Computational Geometry

Volumn , Issue , 2005, Pages 321-326

  Eppstein, David ^a   Wortman, Kevin A ^a  

^a Irvine   (United States)

Author keywords

Dilation; Euclidean graphs; Facility location; Quasiconvex programming; Stretch factor

Indexed keywords

DILATION; EUCLIDEAN GRAPHS; FACILITY LOCATION; QUASICONVEX PROGRAMMING; STRETCH FACTOR;

ALGORITHMS; COMPUTER PROGRAMMING; GRAPHIC METHODS; PROBLEM SOLVING;

GRAPH THEORY;

EID: 33244486527     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1064092.1064142     Document Type: Conference Paper

References (10)

1. P. K. Agarwal, R. Klein, C. Knauer, and M. Sharir. Computing the detour of polygonal curves. Technical Report B Freie Universität Berlin, Fachbereich Mathematik und Informatik, 2002.
2. A. B. Amenta, M. W. Bern, and D. Eppstein. Optimal point placement for mesh smoothing. J. Algorithms, 30(2):302-322, February 1999. Special issue for 8th SODA.
3. T. M. Chan. An optimal randomized algorithm for maximum Tukey depth. In Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms, pages 430-436. Society for Industrial and Applied Mathematics, 2004.
4. Z. Drezner and H. W. Harnacher, Facility Location: Applications and Theory. Springer-Verlag, 2001.
5. D. Eppstein. Spanning trees and spanners. In J.-R, Sack and J. Urrutia, editors, Handbook of Computational Geometry, chapter 9, pages 425-461. Elsevier, 2000.
6. D. Eppstein. Quasiconvex programming. ACM Computing Research Repository, cs.CG/0412046, 2004.
7. S. Langerman, P. Morin, and M. A. Soss. Computing the maximum detour and spanning ratio of planar paths, trees, and cycles. In Proceedings of the 19th Annual Symposium on Theoretical Aspects of Computer Science, pages 250-261. Springer-Verlag, 2002.
8. G. Narasimhan and M. Smid. Approximating the stretch factor of euclidean graphs. SIAM J. Comput., 30(3):978-989, 2000.
9. M. Sharir and P. K. Agarwal. Davenport-Schinzel sequences and their geometric applications. Cambridge University Press, 1996.
10. P. M. Vaidya. An O(nlog n) algorithm for the all-nearest-neighbors problem. Discrete Comput. Geom., 4(2):101-115, 1989.