Editing Euclidean minimum spanning tree (section)

== References ==
{{reflist|refs=

<ref name=1steiner>{{citation
 | last1 = Georgakopoulos | first1 = George
 | last2 = Papadimitriou | first2 = Christos H. | author2-link = Christos Papadimitriou
 | doi = 10.1016/0196-6774(87)90032-0
 | issue = 1
 | journal = Journal of Algorithms
 | mr = 875330
 | pages = 122–130
 | title = The 1-Steiner tree problem
 | volume = 8
 | year = 1987}}</ref>

<ref name=abb>{{citation
 | last1 = Akitaya | first1 = Hugo A.
 | last2 = Biniaz | first2 = Ahmad
 | last3 = Bose | first3 = Prosenjit | author3-link = Jit Bose
 | last4 = De Carufel | first4 = Jean-Lou
 | last5 = Maheshwari | first5 = Anil
 | last6 = da Silveira | first6 = Luís Fernando Schultz Xavier
 | last7 = Smid | first7 = Michiel
 | editor1-last = Lubiw | editor1-first = Anna | editor1-link = Anna Lubiw
 | editor2-last = Salavatipour | editor2-first = Mohammad R.
 | contribution = The minimum moving spanning tree problem
 | doi = 10.1007/978-3-030-83508-8_2
 | pages = 15–28
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = Algorithms and Data Structures: 17th International Symposium, WADS 2021, Virtual Event, August 9–11, 2021, Proceedings
 | volume = 12808
 | isbn = 978-3-030-83507-1
 | year = 2021| s2cid = 234599877
 }}</ref>

<ref name=abcfks>{{citation
 | last1 = Angelini | first1 = Patrizio
 | last2 = Bruckdorfer | first2 = Till
 | last3 = Chiesa | first3 = Marco
 | last4 = Frati | first4 = Fabrizio
 | last5 = Kaufmann | first5 = Michael
 | last6 = Squarcella | first6 = Claudio
 | doi = 10.1016/j.comgeo.2012.10.011
 | issue = 2, part B
 | journal = [[Computational Geometry (journal)|Computational Geometry: Theory and Applications]]
 | mr = 3123788
 | pages = 200–213
 | title = On the area requirements of Euclidean minimum spanning trees
 | volume = 47
 | year = 2014| doi-access = free
 }}</ref>

<ref name=aegh>{{citation
 | last1 = Agarwal | first1 = Pankaj K. | author1-link = Pankaj K. Agarwal
 | last2 = Eppstein | first2 = David | author2-link = David Eppstein
 | last3 = Guibas | first3 = Leonidas J. | author3-link = Leonidas J. Guibas
 | last4 = Henzinger | first4 = Monika Rauch | author4-link = Monika Henzinger
 | contribution = Parametric and Kinetic Minimum Spanning Trees
 | doi = 10.1109/SFCS.1998.743510
 | pages = 596–605
 | publisher = IEEE Computer Society
 | title = 39th Annual Symposium on Foundations of Computer Science, FOCS '98, November 8–11, 1998, Palo Alto, California, USA
 | year = 1998| isbn = 0-8186-9172-7 | s2cid = 2559456 | url = https://infoscience.epfl.ch/record/99344/files/AgarwalEGH98.pdf }}</ref>

<ref name=aesw>{{citation
 | last1 = Agarwal | first1 = P. K. | author1-link = Pankaj K. Agarwal
 | last2 = Edelsbrunner | first2 = H. | author2-link = Herbert Edelsbrunner
 | last3 = Schwarzkopf | first3 = O. | author3-link = Otfried Cheong
 | last4 = Welzl | first4 = E. | author4-link = Emo Welzl
 | doi = 10.1007/BF02574698 | doi-access = free
 | issue = 1
 | journal = [[Discrete & Computational Geometry]]
 | mr = 1115099
 | pages = 407–422
 | publisher = Springer
 | title = Euclidean minimum spanning trees and bichromatic closest pairs
 | volume = 6
 | year = 1991}}</ref>

<ref name=ambuhl>{{citation
 | last = Ambühl | first = Christoph
 | editor1-last = Caires | editor1-first = Luís
 | editor2-last = Italiano | editor2-first = Giuseppe F. | editor2-link = Giuseppe F. Italiano
 | editor3-last = Monteiro | editor3-first = Luís
 | editor4-last = Palamidessi | editor4-first = Catuscia | editor4-link = Catuscia Palamidessi
 | editor5-last = Yung | editor5-first = Moti
 | contribution = An optimal bound for the MST algorithm to compute energy efficient broadcast trees in wireless networks
 | doi = 10.1007/11523468_92
 | pages = 1139–1150
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = Automata, Languages and Programming, 32nd International Colloquium, ICALP 2005, Lisbon, Portugal, July 11-15, 2005, Proceedings
 | volume = 3580
 | isbn = 978-3-540-27580-0
 | year = 2005}}</ref>

<ref name=arymou>{{citation
 | last1 = Arya | first1 = Sunil
 | last2 = Mount | first2 = David M. | author2-link = David Mount
 | editor-last = Krauthgamer | editor-first = Robert
 | contribution = A fast and simple algorithm for computing approximate Euclidean minimum spanning trees
 | doi = 10.1137/1.9781611974331.ch85
 | mr = 3478461
 | pages = 1220–1233
 | title = Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2016, Arlington, VA, USA, January 10-12, 2016
 | year = 2016| doi-access = free
 | isbn = 978-1-61197-433-1
 }}</ref>

<ref name=bargot>{{citation
 | last1 = Bartal | first1 = Yair
 | last2 = Gottlieb | first2 = Lee-Ad
 | contribution = A linear time approximation scheme for Euclidean TSP
 | doi = 10.1109/FOCS.2013.80
 | mr = 3246273
 | pages = 698–706
 | title = 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26-29 October, 2013, Berkeley, CA, USA
 | year = 2013| isbn = 978-0-7695-5135-7
 | s2cid = 17514182
 | citeseerx = 10.1.1.409.1291
 }}</ref>

<ref name=bdek>{{citation
 | last1 = Bose | first1 = Prosenjit | author1-link = Jit Bose
 | last2 = Devroye | first2 = Luc | author2-link = Luc Devroye
 | last3 = Evans | first3 = William
 | last4 = Kirkpatrick | first4 = David | author4-link = David G. Kirkpatrick
 | doi = 10.1137/S0895480197318088
 | issue = 2
 | journal = [[SIAM Journal on Discrete Mathematics]]
 | mr = 2257270
 | pages = 412–427
 | title = On the spanning ratio of Gabriel graphs and β-skeletons
 | volume = 20
 | year = 2006}}</ref>

<ref name=bgj78>{{citation
 | last1 = Boyce | first1 = W. M.
 | last2 = Garey | first2 = M. R. | author2-link = Michael Garey
 | last3 = Johnson | first3 = D. S. | author3-link = David S. Johnson
 | doi = 10.1002/net.3230080302
 | issue = 3
 | journal = Networks
 | mr = 491324
 | pages = 187–192
 | title = A note on bisecting minimum spanning trees
 | volume = 8
 | year = 1978}}</ref>

<ref name=bgz>{{citation
 | last1 = Basch | first1 = Julien
 | last2 = Guibas | first2 = Leonidas J. | author2-link = Leonidas J. Guibas
 | last3 = Zhang | first3 = Li
 | editor-last = Boissonnat | editor-first = Jean-Daniel | editor-link = Jean-Daniel Boissonnat
 | contribution = Proximity problems on moving points
 | doi = 10.1145/262839.262998
 | pages = 344–351
 | publisher = Association for Computing Machinery
 | title = Proceedings of the Thirteenth Annual Symposium on Computational Geometry, Nice, France, June 4–6, 1997
 | year = 1997| s2cid = 15556637
 | doi-access = free
 | isbn = 0-89791-878-9
 }}</ref>

<ref name=bm09>{{citation
 | last1 = Buchin | first1 = Kevin
 | last2 = Mulzer | first2 = Wolfgang
 | doi = 10.1145/1944345.1944347
 | issue = 2
 | journal = [[Journal of the ACM]]
 | mr = 2786587
 | page = A6:1–A6:27
 | title = Delaunay triangulations in {{mvar|O}}(sort({{mvar|n}})) time and more
 | volume = 58
 | year = 2011| s2cid = 11316974
 }}</ref>

<ref name=bwy>{{citation
 | last1 = Bentley | first1 = Jon Louis | author1-link = Jon Bentley (computer scientist)
 | last2 = Weide | first2 = Bruce W.
 | last3 = Yao | first3 = Andrew C. | author3-link = Andrew Yao
 | doi = 10.1145/355921.355927
 | issue = 4
 | journal = [[ACM Transactions on Mathematical Software]]
 | mr = 599977
 | pages = 563–580
 | title = Optimal expected-time algorithms for closest point problems
 | volume = 6
 | year = 1980| s2cid = 17238717 | url = https://figshare.com/articles/journal_contribution/6608108 | doi-access = free
 }}</ref>

<ref name=cck>{{citation
 | last1 = Chatterjee | first1 = S.
 | last2 = Connor | first2 = M.
 | last3 = Kumar | first3 = P.
 | editor-last = Festa | editor-first = Paola
 | contribution = Geometric minimum spanning trees with GeoFilterKruskal
 | doi = 10.1007/978-3-642-13193-6_41
 | pages = 486–500
 | publisher = Springer-Verlag
 | series = Lecture Notes in Computer Science
 | title =  Experimental Algorithms: 9th International Symposium, SEA 2010, Ischia Island, Naples, Italy, May 20-22, 2010, Proceedings
 | volume = 6049
 | isbn = 978-3-642-13192-9
 | year = 2010}}</ref>

<ref name=chadyn>{{citation
 | last = Chan | first = Timothy M. | author-link = Timothy M. Chan
 | doi = 10.1145/1706591.1706596
 | issue = 3
 | journal = [[Journal of the ACM]]
 | mr = 2665885
 | page = Article 16
 | title = A dynamic data structure for 3-D convex hulls and 2-D nearest neighbor queries
 | volume = 57
 | year = 2010| s2cid = 47454142 }}</ref>

<ref name=chalev>{{citation
 | last = Chan | first = Timothy M. | author-link = Timothy M. Chan
 | doi = 10.1007/s00454-002-2840-2
 | issue = 3
 | journal = [[Discrete & Computational Geometry]]
 | mr = 1961005
 | pages = 375–393
 | title = On levels in arrangements of curves
 | volume = 29
 | year = 2003| s2cid = 18966889 | doi-access = free
 }}</ref>

<ref name=chrvp>{{citation
 | last1 = Clementi | first1 = Andrea E. F.
 | last2 = Huiban | first2 = Gurvan
 | last3 = Rossi | first3 = Gianluca
 | last4 = Verhoeven | first4 = Yann C.
 | last5 = Penna | first5 = Paolo
 | contribution = On the approximation ratio of the MST-based heuristic for the energy-efficient broadcast problem in static ad-hoc radio networks
 | doi = 10.1109/IPDPS.2003.1213407
 | page = 222
 | publisher = IEEE Computer Society
 | title = 17th International Parallel and Distributed Processing Symposium (IPDPS 2003), 22-26 April 2003, Nice, France, Proceedings
 | year = 2003| isbn = 0-7695-1926-1
 | s2cid = 17863487
 }}</ref>

<ref name=clarkson>{{citation
 | last = Clarkson | first = Kenneth L. | author-link = Kenneth L. Clarkson
 | doi = 10.1007/BF01553902
 | issue = 1–4
 | journal = [[Algorithmica]]
 | mr = 1019387
 | pages = 461–469
 | title = An algorithm for geometric minimum spanning trees requiring nearly linear expected time
 | volume = 4
 | year = 1989| s2cid = 22176641 }}</ref>

<ref name=comment>{{citation
 | last = Toussaint | first = G. T. | author-link = Godfried Toussaint
 | doi = 10.1049/el:19800611
 | issue = 22
 | journal = Electronics Letters
 | page = 860
 | title = Comment: Algorithms for computing relative neighborhood graph
 | volume = 16
 | year = 1980| bibcode = 1980ElL....16..860T }}; reply by Urquhart, [[doi:10.1049/el:19800612|pp. 860–861]]</ref>

<ref name=devillers>{{citation
 | last = Devillers | first = Olivier
 | doi = 10.1142/S021819599200007X
 | issue = 1
 | journal = International Journal of Computational Geometry & Applications
 | mr = 1159844
 | pages = 97–111
 | title = Randomization yields simple {{math|''O''(''n'' log<sup>*</sup> ''n)''}} algorithms for difficult {{math|&Omega;(''n'')}} problems
 | url = https://hal.inria.fr/inria-00167206/file/hal.pdf
 | volume = 2
 | year = 1992| s2cid = 60203
 }}</ref>

<ref name=dwyer>{{citation
 | last = Dwyer | first = Rex A.
 | doi = 10.1007/BF02574694
 | issue = 4
 | journal = [[Discrete & Computational Geometry]]
 | mr = 1098813
 | pages = 343–367
 | title = Higher-dimensional Voronoi diagrams in linear expected time
 | volume = 6
 | year = 1991| doi-access = free
 }}</ref>

<ref name=eppstein>{{citation
 | last = Eppstein | first = David | author-link = David Eppstein
 | editor1-last = Sack | editor1-first = J.-R. | editor1-link = Jörg-Rüdiger Sack
 | editor2-last = Urrutia | editor2-first = J. | editor2-link = Jorge Urrutia Galicia
 | contribution = Spanning trees and spanners
 | contribution-url = https://www.ics.uci.edu/~eppstein/pubs/Epp-TR-96-16.pdf
 | mr = 1746681
 | pages = 425–461
 | publisher = Elsevier
 | title = Handbook of Computational Geometry
 | year = 1999}}</ref>

<ref name=ew94>{{citation
 | last1 = Eades | first1 = Peter | author1-link = Peter Eades
 | last2 = Whitesides | first2 = Sue | author2-link = Sue Whitesides
 | doi = 10.1007/s004539900037
 | issue = 1
 | journal = [[Algorithmica]]
 | mr = 1394494
 | pages = 60–82
 | title = The realization problem for Euclidean minimum spanning trees is NP-hard
 | volume = 16
 | year = 1996}}</ref>

<ref name=extrema>{{citation
 | last = Eppstein | first = David | author-link = David Eppstein
 | doi = 10.1007/BF02574030
 | issue = 1
 | journal = [[Discrete & Computational Geometry]]
 | mr = 1300511
 | pages = 111–122
 | title = Dynamic Euclidean minimum spanning trees and extrema of binary functions
 | volume = 13
 | year = 1995| s2cid = 7339165 | doi-access = free
 }}</ref>

<ref name=fknp>{{citation
 | last1 = Flammini | first1 = Michele
 | last2 = Klasing | first2 = Ralf
 | last3 = Navarra | first3 = Alfredo
 | last4 = Perennes | first4 = Stephane
 | doi = 10.1007/s00453-007-9077-7
 | issue = 4
 | journal = Algorithmica
 | mr = 2358524
 | pages = 318–336
 | title = Improved approximation results for the minimum energy broadcasting problem
 | volume = 49
 | year = 2007| s2cid = 11982404
 }}</ref>

<ref name=frakau>{{citation
 | last1 = Frati | first1 = Fabrizio
 | last2 = Kaufmann | first2 = Michael
 | doi = 10.1016/j.comgeo.2011.05.005
 | issue = 9
 | journal = [[Computational Geometry (journal)|Computational Geometry: Theory and Applications]]
 | mr = 2819643
 | pages = 529–543
 | title = Polynomial area bounds for MST embeddings of trees
 | volume = 44
 | year = 2011| s2cid = 5634139
 | doi-access = free
 }}</ref>

<ref name=gilpol>{{citation
 | last1 = Gilbert | first1 = E. N. | author1-link = Edgar Gilbert
 | last2 = Pollak | first2 = H. O. | author2-link = Henry O. Pollak
 | doi = 10.1137/0116001
 | journal = [[SIAM Journal on Applied Mathematics]]
 | jstor = 2099400
 | mr = 223269
 | pages = 1–29
 | title = Steiner minimal trees
 | volume = 16
 | year = 1968| issue = 1 }}</ref>

<ref name=gowros>{{citation
 | last1 = Gower | first1 = J. C.
 | last2 = Ross | first2 = G. J. S.
 | doi = 10.2307/2346439
 | journal = Applied Statistics
 | jstor = 2346439
 | mr = 242315
 | pages = 54–61
 | title = Minimum spanning trees and single linkage cluster analysis
 | volume = 18
 | year = 1969| issue = 1
 }}</ref>

<ref name=history>{{citation
 | last1 = Graham | first1 = R. L. | author1-link = Ronald Graham
 | last2 = Hell | first2 = Pavol | author2-link = Pavol Hell
 | doi = 10.1109/mahc.1985.10011
 | issue = 1
 | journal = IEEE Annals of the History of Computing
 | mr = 0783327
 | pages = 43–57
 | title = On the history of the minimum spanning tree problem
 | volume = 7
 | year = 1985| s2cid = 10555375 }}</ref>

<ref name=king>{{citation
 | last = King | first = James A.
 | contribution = Realization of degree 10 minimum spanning trees in 3-space
 | contribution-url = https://www.cs.queensu.ca/cccg/papers/cccg11.pdf
 | pages = 39–42
 | title = Proceedings of the 18th Annual Canadian Conference on Computational Geometry, CCCG 2006, August 14-16, 2006, Queen's University, Ontario, Canada
 | year = 2006}}</ref>

<ref name=kissing>{{citation|last1=Pfender|first1=Florian|last2=Ziegler|first2=Günter M.|author-link2=Günter M. Ziegler|title=Kissing numbers, sphere packings, and some unexpected proofs|journal=[[Notices of the American Mathematical Society]]|date=September 2004|pages=873–883|url=https://www.ams.org/notices/200408/fea-pfender.pdf}}</ref>

<ref name=kkt>{{citation
 | last1 = Karger | first1 = David R. | author1-link = David Karger
 | last2 = Klein | first2 = Philip N.
 | last3 = Tarjan | first3 = Robert E. | author3-link = Robert Tarjan
 | doi = 10.1145/201019.201022
 | issue = 2
 | journal = [[Journal of the ACM]]
 | mr = 1409738
 | pages = 321–328
 | title = A randomized linear-time algorithm to find minimum spanning trees
 | volume = 42
 | year = 1995| s2cid = 832583 | doi-access = free
 }}</ref>

<ref name=kln>{{citation
 | last1 = Krznaric | first1 = Drago
 | last2 = Levcopoulos | first2 = Christos
 | last3 = Nilsson | first3 = Bengt J.
 | issue = 4
 | journal = Nordic Journal of Computing
 | mr = 1736451
 | pages = 446–461
 | title = Minimum spanning trees in <math>d</math> dimensions
 | volume = 6
 | year = 1999}}. This version of this paper is not available online; instead, see the 1997 conference version of the same paper, {{doi|10.1007/3-540-63397-9_26}}.</ref>

<ref name=kti>{{citation
 | last1 = Katoh | first1 = N.
 | last2 = Tokuyama | first2 = T.
 | last3 = Iwano | first3 = K.
 | doi = 10.1007/BF02574035
 | issue = 2
 | journal = [[Discrete & Computational Geometry]]
 | mr = 1314960
 | pages = 161–176
 | title = On minimum and maximum spanning trees of linearly moving points
 | volume = 13
 | year = 1995| doi-access = free
 }}</ref>

<ref name=lee>{{citation
 | last = Lee | first = In-Kwon
 | doi = 10.1016/S0167-8396(99)00044-8
 | issue = 2
 | journal = Computer Aided Geometric Design
 | mr = 1733203
 | pages = 161–177
 | title = Curve reconstruction from unorganized points
 | volume = 17
 | year = 2000| citeseerx = 10.1.1.56.1432
 }}</ref>

<ref name=lobwei>{{citation
 | last1 = Loberman | first1 = H.
 | last2 = Weinberger | first2 = A.
 | date = October 1957
 | doi = 10.1145/320893.320896
 | issue = 4
 | journal = [[Journal of the ACM]]
 | pages = 428–437
 | title = Formal procedures for connecting terminals with a minimum total wire length
 | volume = 4| s2cid = 7320964
 | doi-access = free
 }}</ref>

<ref name=mares>{{citation
 | last = Mareš | first = Martin
 | issue = 3
 | journal = Archivum Mathematicum
 | mr = 2107027
 | pages = 315–320
 | title = Two linear time algorithms for MST on minor closed graph classes
 | url = https://www.emis.de/journals/AM/04-3/am1139.pdf
 | volume = 40
 | year = 2004}}</ref>

<ref name=monsur>{{citation
 | last1 = Monma | first1 = Clyde
 | last2 = Suri | first2 = Subhash | author2-link = Subhash Suri
 | doi = 10.1007/BF02293049
 | issue = 3
 | journal = [[Discrete & Computational Geometry]]
 | mr = 1174358
 | pages = 265–293
 | title = Transitions in geometric minimum spanning trees
 | volume = 8
 | year = 1992| s2cid = 30101649
 | doi-access = free
 }}</ref>

<ref name=mrg>{{citation
 | last1 = March | first1 = William B.
 | last2 = Ram | first2 = Parikshit
 | last3 = Gray | first3 = Alexander G.
 | editor1-last = Rao | editor1-first = Bharat
 | editor2-last = Krishnapuram | editor2-first = Balaji
 | editor3-last = Tomkins | editor3-first = Andrew
 | editor4-last = Yang | editor4-first = Qiang
 | contribution = Fast Euclidean minimum spanning tree: algorithm, analysis, and applications
 | doi = 10.1145/1835804.1835882
 | pages = 603–612
 | title = Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington, DC, USA, July 25-28, 2010
 | year = 2010| s2cid = 186025
 }}</ref>

<ref name=msvw>{{citation
 | last1 = Meulemans | first1 = Wouter
 | last2 = Speckmann | first2 = Bettina | author2-link = Bettina Speckmann
 | last3 = Verbeek | first3 = Kevin
 | last4 = Wulms | first4 = Jules
 | editor1-last = Bender | editor1-first = Michael A.
 | editor2-last = Farach-Colton | editor2-first = Martin | editor2-link = Martin Farach-Colton
 | editor3-last = Mosteiro | editor3-first = Miguel A.
 | contribution = A framework for algorithm stability and its application to kinetic Euclidean MSTs
 | doi = 10.1007/978-3-319-77404-6_58
 | pages = 805–819
 | publisher = Springer
 | series = Lecture Notes in Computer Science
 | title = LATIN 2018: Theoretical Informatics – 13th Latin American Symposium, Buenos Aires, Argentina, April 16–19, 2018, Proceedings
 | volume = 10807
 | isbn = 978-3-319-77403-9
 | year = 2018| s2cid = 4709616
 | url = https://research.tue.nl/nl/publications/bde45eae-314a-42b4-8dca-9a0a420f38e1
 }}</ref>

<ref name=nzz>{{citation
 | last1 = Narasimhan | first1 = Giri
 | last2 = Zachariasen | first2 = Martin
 | last3 = Zhu | first3 = Jianlin
 | contribution = Experiments with computing geometric minimum spanning trees
 | pages = 183–196
 | title = Proceedings of the 2nd Workshop on Algorithm Engineering and Experiments
 | year = 2000}}</ref>

<ref name=offline>{{citation
 | last = Eppstein | first = David | author-link = David Eppstein
 | doi = 10.1006/jagm.1994.1033
 | issue = 2
 | journal = Journal of Algorithms
 | mr = 1291541
 | pages = 237–250
 | title = Offline algorithms for dynamic minimum spanning tree problems
 | volume = 17
 | year = 1994| url = https://escholarship.org/uc/item/6j46j8nc }}</ref>

<ref name=penrose>{{citation
 | last = Penrose | first = Mathew D.
 | doi = 10.1214/aoap/1034625335
 | issue = 2
 | journal = The Annals of Applied Probability
 | mr = 1442317
 | pages = 340–361
 | title = The longest edge of the random minimal spanning tree
 | volume = 7
 | year = 1997| doi-access = free
 }}</ref>

<ref name=presha>{{citation
 | last1 = Preparata | first1 = Franco P. | author1-link = Franco P. Preparata
 | last2 = Shamos | first2 = Michael Ian | author2-link = Michael Ian Shamos
 | doi = 10.1007/978-1-4612-1098-6
 | isbn = 0-387-96131-3
 | mr = 805539
 | page = 263
 | publisher = Springer-Verlag, New York
 | series = Texts and Monographs in Computer Science
 | title = Computational Geometry: An Introduction
 | year = 1985| s2cid = 206656565 }}</ref>

<ref name=rakwz>{{citation
 | last1 = Rahmati | first1 = Zahed
 | last2 = Abam | first2 = Mohammad Ali
 | last3 = King | first3 = Valerie | author3-link = Valerie King
 | last4 = Whitesides | first4 = Sue | author4-link = Sue Whitesides
 | last5 = Zarei | first5 = Alireza
 | doi = 10.1016/j.comgeo.2014.12.002
 | issue = 4
 | journal = Computational Geometry: Theory & Applications
 | mr = 3296072
 | pages = 342–359
 | title = A simple, faster method for kinetic proximity problems
 | volume = 48
 | year = 2015| s2cid = 18971251
 | doi-access = free
 | arxiv = 1311.2032
 }}</ref>

<ref name=robsal>{{citation
 | last1 = Robins | first1 = G.
 | last2 = Salowe | first2 = J. S.
 | doi = 10.1007/BF02570700
 | issue = 2
 | journal = [[Discrete & Computational Geometry]]
 | mr = 1331924
 | pages = 151–165
 | title = Low-degree minimum spanning trees
 | volume = 14
 | year = 1995| s2cid = 16040977
 | doi-access = free
 }}</ref>

<ref name=rzcomb>{{citation
 | last1 = Rahmati | first1 = Zahed
 | last2 = Zarei | first2 = Alireza
 | contribution = Combinatorial changes of Euclidean minimum spanning tree of moving points in the plane
 | contribution-url = https://cccg.ca/proceedings/2010/paper14.pdf
 | pages = 43–45
 | title = Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, Winnipeg, Manitoba, Canada, August 9-11, 2010
 | year = 2010}}</ref>

<ref name=rzkin>{{citation
 | last1 = Rahmati | first1 = Zahed
 | last2 = Zarei | first2 = Alireza
 | doi = 10.1016/j.jda.2012.04.009
 | journal = Journal of Discrete Algorithms
 | mr = 2960341
 | pages = 2–11
 | title = Kinetic Euclidean minimum spanning tree in the plane
 | volume = 16
 | year = 2012| doi-access = free
 }}</ref>

<ref name=shahoe>{{citation
 | last1 = Shamos | first1 = Michael Ian | author1-link = Michael Ian Shamos
 | last2 = Hoey | first2 = Dan
 | contribution = Closest-point problems
 | doi = 10.1109/SFCS.1975.8
 | mr = 0426498
 | pages = 151–162
 | publisher = IEEE Computer Society
 | title = 16th Annual Symposium on Foundations of Computer Science, Berkeley, California, USA, October 13-15, 1975
 | title-link = Symposium on Foundations of Computer Science
 | year = 1975| s2cid = 40615455 }}</ref>

<ref name=ss89>{{citation
 | last1 = Steele | first1 = J. Michael | author1-link = J. Michael Steele
 | last2 = Snyder | first2 = Timothy Law | author2-link = Timothy Law Snyder
 | doi = 10.1137/0218019
 | issue = 2
 | journal = [[SIAM Journal on Computing]]
 | mr = 986667
 | pages = 278–287
 | title = Worst-case growth rates of some classical problems of combinatorial optimization
 | volume = 18
 | year = 1989| url = https://repository.upenn.edu/cgi/viewcontent.cgi?article=1048&context=oid_papers }}</ref>

<ref name=sse>{{citation
 | last1 = Steele | first1 = J. Michael | author1-link = J. Michael Steele
 | last2 = Shepp | first2 = Lawrence A.
 | last3 = Eddy | first3 = William F.
 | doi = 10.2307/3214207
 | issue = 4
 | journal = Journal of Applied Probability
 | mr = 913823
 | pages = 809–826
 | title = On the number of leaves of a Euclidean minimal spanning tree
 | volume = 24
 | year = 1987| jstor = 3214207 | s2cid = 29026025 }}</ref>

<ref name=steele>{{citation
 | last = Steele | first = J. Michael | author-link = J. Michael Steele
 | doi = 10.1214/aop/1176991596 | doi-access = free
 | issue = 4
 | journal = [[Annals of Probability]]
 | jstor = 2243991
 | mr = 0958215
 | pages = 1767–1787
 | title = Growth rates of Euclidean minimal spanning trees with power weighted edges
 | volume = 16
 | year = 1988}}</ref>

<ref name=topp>{{citation|url=https://topp.openproblem.net/p5|publisher=Smith College|work=The Open Problems Project|title=Problem 5: Euclidean Minimum Spanning Tree|date=2001–2002|first1=J.|last1=O'Rourke|author1-link=Joseph O'Rourke (professor)|first2=E.|last2=Demaine|author2-link=Erik Demaine}}</ref>

<ref name=urban>{{citation
 | last1 = Wu | first1 = Bin
 | last2 = Yu | first2 = Bailang
 | last3 = Wu | first3 = Qiusheng
 | last4 = Chen | first4 = Zuoqi
 | last5 = Yao | first5 = Shenjun
 | last6 = Huang | first6 = Yan
 | last7 = Wu | first7 = Jianping
 | date = October 2017
 | doi = 10.1080/13658816.2017.1384830
 | issue = 3
 | journal = International Journal of Geographical Information Science
 | pages = 450–475
 | title = An extended minimum spanning tree method for characterizing local urban patterns
 | volume = 32| s2cid = 46772272
 }}</ref>

<ref name=wclf>{{citation
 | last1 = Wan | first1 = P.-J.
 | last2 = Călinescu | first2 = G.
 | last3 = Li | first3 = X.-Y.
 | last4 = Frieder | first4 = O.
 | doi = 10.1023/a:1020381720601
 | issue = 6
 | journal = Wireless Networks
 | pages = 607–617
 | title = Minimum-energy broadcasting in static ad hoc wireless networks
 | volume = 8
 | year = 2002| s2cid = 1297518
 }}</ref>

<ref name=yao82>{{citation
 | last = Yao | first = Andrew Chi Chih | author-link = Andrew Yao
 | doi = 10.1137/0211059
 | issue = 4
 | journal = [[SIAM Journal on Computing]]
 | mr = 677663
 | pages = 721–736
 | title = On constructing minimum spanning trees in {{mvar|k}}-dimensional spaces and related problems
 | volume = 11
 | year = 1982}}</ref>

<ref name=yao89>{{citation
 | last = Yao | first = Andrew Chi-Chih | author-link = Andrew Yao
 | doi = 10.1137/0220041
 | issue = 4
 | journal = [[SIAM Journal on Computing]]
 | mr = 1105929
 | pages = 655–668
 | title = Lower bounds for algebraic computation trees with integer inputs
 | volume = 20
 | year = 1991}}</ref>

<ref name=zahn>{{citation
 | last = Zahn | first = C. T.
 | contribution = Using the minimum spanning tree to recognize dotted and dashed curves
 | contribution-url = https://cds.cern.ch/record/1050916
 | title = 1st International Computing Symposium, Davos, Switzerland, 4–7 September 1973
 | year = 1973}}</ref>

}}