Skip to main content
SpringerLink
Log in

Minimum Geometric Spanning Trees

  • Reference work entry
  • First Online:
Book cover Encyclopedia of Algorithms

  • 72 Accesses

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 1,599.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Hardcover Book
USD 1,999.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Recommended Reading

  1. Agarwal PK, Edelsbrunner H, Schwarzkopf O, Welzl E (1991) Euclidean minimum spanning trees and bichromatic closest pairs. Discret Comput Geom 6:407–422

    Google Scholar 

  2. Bespamyatnikh S (1997) On constructing minimum spanning trees in R1k. Algorithmica 18(4): 524–529

    Google Scholar 

  3. Bespamyatnikh S (1998) An optimal algorithm for closest-pair maintenance. Discret Comput Geom 19(2):175–195

    Google Scholar 

  4. Callahan PB, Kosaraju SR (1993) Faster algorithms for some geometric graph problems in higher dimensions. In: SODA, Austin, pp 291–300

    Google Scholar 

  5. Chatterjee S, Connor M, Kumar P (2010) Geometric minimum spanning trees with GeoFilterKruskal. In: Experimental Algorithms: proceedings of SEA, Ischia Island. LNCS, vol 6049, pp 486–500

    Google Scholar 

  6. Cheriton D, Tarjan RE (1976) Finding minimum spanning trees. SIAM J Comput 5(4):724–742

    Google Scholar 

  7. Clarkson KL (1984) Fast expected-time and approximation algorithms for geometric minimum spanning trees. In: Proceedings of STOC, Washington, DC, pp 342–348

    Google Scholar 

  8. Czumaj A, Ergün F, Fortnow L, Magen A, Newman I, Rubinfeld R, Sohler C (2005) Approximating the weight of the Euclidean minimum spanning tree in sublinear time. SIAM J Comput 35(1):91–109

    Google Scholar 

  9. Eppstein D (1995) Dynamic Euclidean minimum spanning trees and extrema of binary functions. Discret Comput Geom 13:111–122

    Google Scholar 

  10. Gabow HN, Bentley JL, Tarjan RE (1984) Scaling and related techniques for geometry problems. In: STOC, Washington, DC, pp 135–143

    Google Scholar 

  11. Krznaric D, Levcopoulos C, Nilsson BJ (1999) Minimum spanning trees in d dimensions. Nord J Comput 6(4):446–461

    Google Scholar 

  12. Narasimhan G, Zachariasen M (2001) Geometric minimum spanning trees via well-separated pair decompositions. ACM J Exp Algorithms 6:6

    Google Scholar 

  13. Salowe JS (1991) Constructing multidimensional spanner graphs. Int J Comput Geom Appl 1(2):99–107

    Google Scholar 

  14. Vaidya PM (1988) Minimum spanning trees in k-Dimensional space. SIAM J Comput 17(3):572–582

    Google Scholar 

  15. Yao AC (1982) On constructing minimum spanning trees in k-Dimensional spaces and related problems. SIAM J Comput 11(4):721–736

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Lund University, Lund, Sweden

    Christos Levcopoulos

Authors
  1. Christos Levcopoulos
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Christos Levcopoulos .

Editor information

Editors and Affiliations

  1. Department of Electrical Engineering and Computer Science, Northwestern University, Evanston, IL, USA

    Ming-Yang Kao

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer Science+Business Media New York

About this entry

Cite this entry

Levcopoulos, C. (2016). Minimum Geometric Spanning Trees. In: Kao, MY. (eds) Encyclopedia of Algorithms. Springer, New York, NY. https://doi.org/10.1007/978-1-4939-2864-4_236

Download citation

Publish with us

Policies and ethics

Search

Navigation