Article

Free access

Fast expected-time and approximation algorithms for geometric minimum spanning trees

Author:

Kenneth L. ClarksonAuthors Info & Claims

STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing

Pages 342 - 348

https://doi.org/10.1145/800057.808699

Published: 01 December 1984 Publication History

PDF eReader

References

[1]

C. Berge and A. Ghouila-Houri. Programming,Games, and Transportation Networks,. John Wiley, New York, 1965.

Google Scholar

[2]

J. L. Bentley, H. Gabow, and R. E. Tarjan. Scaling and related techniques for geometry problems. These proceedings.

Google Scholar

[3]

J. L. Bentley, B. Weide, and A. C. Yao. Optimal expected-time algorithms for closest-point problems. ACM Trans. Math. Software, Volume 6 (1982), Number 4, pp. 563-579.

Digital Library

Google Scholar

[4]

K .L . Clarkson. Fast algorithms for the all nearest neighbors problem. Proc. 24th Symp. on Foundations of Computer Science, Tucson, AZ, November 1983, pp. 226-232.

Digital Library

Google Scholar

[5]

K. L. Clarkson. A nearly linear expected time algorithm for minimum spanning trees in coordinate spaces. Unpublished manuscript, 1983.

Google Scholar

[6]

L. Devroye. Average time behavior of distributive sorting algorithms. Tech. Rep. No. SOCS 79.4, School of Computer Science, McGill University, 1979.

Google Scholar

[7]

D. Dobkin. Personal communication.

Google Scholar

[8]

M. L. Fredman and R. E. Tarjan. Fibonacci heaps and their uses in network optimization algorithms. Unpublished manuscript, 1984.

Google Scholar

[9]

L. J. Guibas and J. Stolfi. On computing all north-east nearest neighbors in the L1 metric. Unpublished manuscript.

Google Scholar

[10]

D. Kirkpatrick. Optimal search in planar subdivisions. SIAM Journal of Computing, Volume 12 (1983), pp. 28-35.

Digital Library

Google Scholar

[11]

J. B. Kruskal, Jr. On the shortest spanning subgraph of a graph and the traveling salesman problem. Proc. Amer. Math. Soc., Volume 7 (1956), pp. 48-50.

Crossref

Google Scholar

[12]

G. Lueker. A survey of address calculation techniques with unknown input distributions. Unpublished manuscript, 1983.

Google Scholar

[13]

D. T. Lee and C.K. Wong. Voronoi diagrams in L&1 (Loo) metrics with 2-dimensional storage applications. SIAM Journal of Computing, Volume 9 (1980), pp. 200-211.

Digital Library

Google Scholar

[14]

M. I. Shamos and D. Hoey. Closest-point problems. Proc. 16th Symp. on Foundations of Computer Science, 1975, pp. 151-162.

Digital Library

Google Scholar

[15]

J. Stolfi. Personal communication.

Google Scholar

[16]

K. J. Supowit. The relative neighborhood graph, with an application to minimum spanning trees. J. Assoc. Comp. Mach., Volume 30 (1983), pp. 428-447.

Digital Library

Google Scholar

[17]

R. E. Tarjan. Efficiency of a good but not linear disjoint set union algorithm. J. Assoc. Comp. Mach.,| Volume 22 (1975), pp. 215-225.

Digital Library

Google Scholar

[18]

A. C. Yao. On constructing minimum spanning trees in k-dimensional spaces and related problems. SIAM Journal of Computing, Volume 11 (1982), Number 4, pp. 721-736.

Digital Library

Google Scholar

Cited By

View all

Levcopoulos C(2016)Minimum Geometric Spanning TreesEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_236(1315-1318)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_236
Alvarez VSeidel R(2010)Approximating the minimum weight spanning tree of a set of points in the Hausdorff metricComputational Geometry: Theory and Applications10.1016/j.comgeo.2009.04.00543:2(94-98)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1016/j.comgeo.2009.04.005
Levcopoulos C(2008)Minimum Geometric Spanning TreesEncyclopedia of Algorithms10.1007/978-0-387-30162-4_236(533-536)Online publication date: 2008
https://doi.org/10.1007/978-0-387-30162-4_236
Show More Cited By

Index Terms

Fast expected-time and approximation algorithms for geometric minimum spanning trees
1. Mathematics of computing
  1. Discrete mathematics
    1. Graph theory
      1. Trees
2. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs

Both the building cost and the multiple-source routing cost are important considerations in construction of a network system. A spanning tree with minimum building cost among all spanning trees is called a minimum spanning tree (MST), and a spanning ...
Degree-bounded minimum spanning trees

Given n points in the Euclidean plane, the degree-@d minimum spanning tree (MST) problem asks for a spanning tree of minimum weight in which the degree of each vertex is at most @d. The problem is NP-hard for 2@__ __@d@__ __3, while the NP-hardness of ...
Approximating k-hop minimum-spanning trees

Given a complete graph on~n nodes with metric edge costs, the minimum-costk-hop spanning tree (kHMST) problem asks for a spanning tree of minimum total cost such that the longest root-leaf-path in the tree has at most k edges. We present an algorithm ...

Comments

Information & Contributors

Information

Published In

STOC '84: Proceedings of the sixteenth annual ACM symposium on Theory of computing

December 1984

547 pages

ISBN:0897911334

DOI:10.1145/800057

Chairman:
Richard DeMillo

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 December 1984

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

11
Total Citations
View Citations
329
Total Downloads

Downloads (Last 12 months)34
Downloads (Last 6 weeks)10

Reflects downloads up to 10 Nov 2024

Other Metrics

View Author Metrics

Citations

Cited By

View all

Levcopoulos C(2016)Minimum Geometric Spanning TreesEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_236(1315-1318)Online publication date: 22-Apr-2016
https://doi.org/10.1007/978-1-4939-2864-4_236
Alvarez VSeidel R(2010)Approximating the minimum weight spanning tree of a set of points in the Hausdorff metricComputational Geometry: Theory and Applications10.1016/j.comgeo.2009.04.00543:2(94-98)Online publication date: 1-Feb-2010
https://dl.acm.org/doi/10.1016/j.comgeo.2009.04.005
Levcopoulos C(2008)Minimum Geometric Spanning TreesEncyclopedia of Algorithms10.1007/978-0-387-30162-4_236(533-536)Online publication date: 2008
https://doi.org/10.1007/978-0-387-30162-4_236
Wee YChaiken SRavi S(1994)Rectilinear steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighborsAlgorithmica10.1007/BF0118871312:6(421-435)Online publication date: 1-Dec-1994
https://dl.acm.org/doi/10.1007/BF01188713
Agarwal PEdelsbrunner HSchwarzkopf OWelzl E(1991)Euclidean minimum spanning trees and bichromatic closest pairsDiscrete & Computational Geometry10.5555/2805868.28336726:1(407-422)Online publication date: 1-Dec-1991
https://dl.acm.org/doi/10.5555/2805868.2833672
Salowe JDrysdale R(1991)Construction of multidimensional spanner graphs, with applications to minimum spanning treesProceedings of the seventh annual symposium on Computational geometry10.1145/109648.109677(256-261)Online publication date: 1-Jun-1991
https://dl.acm.org/doi/10.1145/109648.109677
Agarwal PMatoušek JSuri S(1991)Farthest neighbors, maximum spanning trees and related problems in higher dimensionsAlgorithms and Data Structures10.1007/BFb0028254(105-116)Online publication date: 1991
https://doi.org/10.1007/BFb0028254
Agarwal PEdelsbrunner HSchwarzkopf OWelzl E(1991)Euclidean minimum spanning trees and bichromatic closest pairsDiscrete & Computational Geometry10.1007/BF025746986:3(407-422)Online publication date: 1-Dec-1991
https://dl.acm.org/doi/10.1007/BF02574698
Agarwal PEdelsbrunner HSchwarzkopf OWelzl ESeidel R(1990)Euclidean minimum spanning trees and bichromatic closest pairsProceedings of the sixth annual symposium on Computational geometry10.1145/98524.98567(203-210)Online publication date: 1-May-1990
https://dl.acm.org/doi/10.1145/98524.98567
Vaidya P(1989)Approximate minimum weight matching on points ink-dimensional spaceAlgorithmica10.1007/BF015539094:1-4(569-583)Online publication date: Jun-1989
https://doi.org/10.1007/BF01553909
Show More Cited By

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

References

Cited By

Index Terms

Recommendations

Balancing minimum spanning trees and multiple-source minimum routing cost spanning trees on metric graphs

Degree-bounded minimum spanning trees

Approximating k-hop minimum-spanning trees

Comments

Information

Published In

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Acceptance Rates

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Get Access

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations