research-article

Stochastic minimum spanning trees in euclidean spaces

Authors:

Timothy M. Chan,

Subhash SuriAuthors Info & Claims

SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometry

Pages 65 - 74

https://doi.org/10.1145/1998196.1998206

Published: 13 June 2011 Publication History

Abstract

We study the complexity of geometric minimum spanning trees under a stochastic model of input: Suppose we are given a master set of points s₁,s_2,...,s_n in d-dimensional Euclidean space, where each point s_i is active with some independent and arbitrary but known probability p_i. We want to compute the expected length of the minimum spanning tree (MST) of the active points. This particular form of stochastic problems is motivated by the uncertainty inherent in many sources of geometric data but has not been investigated before in computational geometry to the best of our knowledge. Our main results include the following.

We show that the stochastic MST problem is SPHARD for any dimension d ≥ 2. We present a simple fully polynomial randomized approximation scheme (FPRAS) for a metric space, and thus also for any Euclidean space. For d=2, we present two deterministic approximation algorithms: an O(n⁴)-time constant-factor algorithm, and a PTAS based on a combination of shifted quadtrees and dynamic programming. We show that in a general metric space the tail bounds of the distribution of the MST length cannot be approximated to any multiplicative factor in polynomial time under the assumption that P ≠ NP.

In addition to this existential model of stochastic input, we also briefly consider a locational model where each point is present with certainty but its location is probabilistic.

References

[1]

I. Althöfer, G. Das, D. Dobkin, D. Joseph, and J. Soares. On sparse spanners of weighted graphs. Discrete Comput. Geom., 9(1):81--100, 1993.

Digital Library

[2]

S. Arora. Polynomial time approximation schemes for euclidean tsp and other geometric problems. In FOCS, pages 2--11, 1996.

Digital Library

[3]

S. Arora. Polynomial time approximation schemes for euclidean traveling salesman and other geometric problems. J. ACM, 45(5):753--782, 1998.

Digital Library

[4]

J. Beardwood, J. H. Halton, and J. M. Hammersley. The shortest path through many points. Proc. Cambridge Philos. Soc., 55:299--327, 1959.

[5]

M. W. Bern and D. Eppstein. Worst-case bounds for subadditive geometric graphs. In Symposium on Computational Geometry, pages 183--188, 1993.

Digital Library

[6]

D. Bertsimas. Probabilistic Combinatorial Optimization Problems. PhD thesis, Operation Research Center, MIT, Cambridge, MASS, 1988.

[7]

T. M. Chan. Well-separated pair decomposition in linear time? Inf. Process. Lett., 107(5):138--141, 2008.

Digital Library

[8]

M. De Berg, O. Cheong, and M. van Kreveld. Computational geometry: algorithms and applications. Springer, 2008.

Digital Library

[9]

K. Dhamdhere, R. Ravi, and M. Singh. On two-stage stochastic minimum spanning trees. In IPCO, volume 3509, pages 321--334, 2005.

Digital Library

[10]

A. D. Flaxman, A. Frieze, and M. Krivelevich. On the random 2-stage minimum spanning tree. In SODA '05: Proc. 16th Annual ACM-SIAM symposium on Discrete algorithms, pages 919--926, 2005.

Digital Library

[11]

P. Gupta, A. Martin, R. Ravi, and A. Sinha. Boosted sampling: Approximation algorithms for stochastic optimization. In Proc. 36th Annual ACM Symposium on Theory of Computing, pages 417--426, 2003.

Digital Library

[12]

M. T. Hajiaghayi, R. Kleinberg, and T. Leighton. Improved lower and upper bounds for universal tsp in planar metrics. In Proceedings of the seventeenth annual ACM-SIAM symposium on Discrete algorithm, SODA '06, pages 649--658. ACM, 2006.

Digital Library

[13]

F. K. Hwang, Richards, and P. D. S., Winter. The Steiner Tree Problem. North-Holland Publishing Company, 1992.

[14]

N. Immorlica, M. Karger, D.and Minkoff, and V. S. Mirrokni. On the costs and benefits of procrastination: approximation algorithms for stochastic combinatorial optimization problems. In SODA '04: Proc. 15th Annual ACM-SIAM symposium on Discrete algorithms, pages 691--700, 2004.

Digital Library

[15]

P. Jaillet. A priori solution of a traveling salesman problem in which a random subset of the customers are visited. Math. Oper. Res., 6(6), 1988.

Digital Library

[16]

I. A. Kanj, L. Perković, and X. Ge. Computing lightweight spanners locally. In DISC '08: Proceedings of the 22nd international symposium on Distributed Computing, pages 365--378, 2008.

Digital Library

[17]

H. J. Karloff. How long can a euclidean traveling salesman tour be? SIAM J. Discrete Math., 2(1), 1989.

Digital Library

[18]

I. Katriel, C. Kenyon-Mathieu, and E. Upfal. Commitment under uncertainty: Two-stage stochastic matching problems. Theoretical Computer Science, 408(2--3):213 -- 223, 2008.

Digital Library

[19]

M. Löffler and J. M. Phillips. Shape fitting on point sets with probability distributions. CoRR, abs/0812.2967, 2008.

[20]

M. Löffler and M. van Kreveld. Largest and smallest convex hulls for imprecise points. Algorithmica, 56:235--269, 2010.

Digital Library

[21]

M. Löffler and M. van Kreveld. Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom. Theory Appl., 43(4):419--433, 2010.

Digital Library

[22]

M. Löffler and M. van Kreveld. Largest bounding box, smallest diameter, and related problems on imprecise points. Comput. Geom., 43(4):419--433, 2010.

Digital Library

[23]

R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995.

Digital Library

[24]

G. Narasimhan and M. Smid. Geometric Spanner Networks. Cambridge University Press, New York, NY, USA, 2007.

Digital Library

[25]

L. K. Platzman and J. B. III. Spacefilling curves and the planar travelling salesman problem. J. ACM, 36(4):719--737, 1989.

Digital Library

[26]

J. S. Provan and M. O. Ball. The complexity of counting cuts and of computing the probability that a graph is connected. SIAM J. Comput., 12(4):777--788, 1983.

Digital Library

[27]

J. S. Provan. The complexity of reliability computations in planar and acyclic graphs. SIAM J. Comput., 15(3):694--702, 1986.

Digital Library

[28]

D. B. Shmoys and K. Talwar. A constant approximation algorithm for the a priori traveling salesman problem. In IPCO, pages 331--343, 2008.

Digital Library

[29]

T. L. Snyder and J. M. Steele. A priori bounds on the euclidean traveling salesman. SIAM J. Comput., 24(3), 1995.

Digital Library

[30]

J. Steele. On frieze's ζ (3) limit for lengths of minimal spanning trees. Ann. Prob., 9:365--376, 1987.

[31]

C. Swamy and D. B. Shmoys. Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News, 37(1):33--46, 2006.

Digital Library

[32]

R. Tamassia. On embedding a graph in the grid with the minimum number of bends. SIAM J. Comput., 16(3):421--444, 1987.

Digital Library

[33]

G. T. Toussaint. The relative neighborhood graph of a finite planar set. Pattern Recognition, 12:261--268, 1980.

Cited By

Fox EHuang HRaichel B(2024)Clustering with faulty centersComputational Geometry10.1016/j.comgeo.2023.102052117(102052)Online publication date: Feb-2024
https://doi.org/10.1016/j.comgeo.2023.102052
Gitik RJoskowicz L(2023)Half-plane point retrieval queries with independent and dependent geometric uncertaintiesComputational Geometry10.1016/j.comgeo.2023.102021(102021)Online publication date: Jun-2023
https://doi.org/10.1016/j.comgeo.2023.102021
Gitik RJoskowicz L(2022)Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric UncertaintiesInternational Journal of Computational Geometry & Applications10.1142/S021819592150005931:02n03(75-121)Online publication date: 25-Jan-2022
https://doi.org/10.1142/S0218195921500059
Show More Cited By

Index Terms

Stochastic minimum spanning trees in euclidean spaces
1. Theory of computation
  1. Randomness, geometry and discrete structures
    1. Computational geometry

Recommendations

Euclidean minimum spanning trees and bichromatic closest pairs

We present an algorithm to compute a Euclidean minimum spanning tree of a given setS ofN points inEd in timeO(Fd(N,N) logdN), whereFd(n,m) is the time required to compute a bichromatic closest pair amongn red andm green points inEd. IfFd(N,N)=Ω(N1+ ), ...
Euclidean minimum spanning trees and bichromatic closest pairs

We present an algorithm to compute a Euclidean minimum spanning tree of a given setS ofN points inEd in timeO(Fd(N,N) logdN), whereFd(n,m) is the time required to compute a bichromatic closest pair amongn red andm green points inEd. IfFd(N,N)=Ω(N1+ ), ...
On the area requirements of Euclidean minimum spanning trees

In their seminal paper on Euclidean minimum spanning trees, Monma and Suri (1992) proved that any tree of maximum degree 5 admits a planar embedding as a Euclidean minimum spanning tree. Their algorithm constructs embeddings with exponential area; ...

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences

SoCG '11: Proceedings of the twenty-seventh annual symposium on Computational geometry

June 2011

532 pages

ISBN:9781450306829

DOI:10.1145/1998196

Program Chairs:
Ferran Hurtado
Universitat Politècnica de Catalunya
,
Marc van Kreveld
Utrecht University

Copyright © 2011 ACM.

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]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 13 June 2011

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Author Tags

Qualifiers

Research-article

Conference

SoCG '11

Sponsor:

SoCG '11: Symposium on Computational Geometry

June 13 - 15, 2011

Paris, France

Acceptance Rates

Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

36
Total Citations
View Citations
330
Total Downloads

Downloads (Last 12 months)20
Downloads (Last 6 weeks)4

Reflects downloads up to 30 Aug 2024

Other Metrics

View Author Metrics

Citations

Cited By

Fox EHuang HRaichel B(2024)Clustering with faulty centersComputational Geometry10.1016/j.comgeo.2023.102052117(102052)Online publication date: Feb-2024
https://doi.org/10.1016/j.comgeo.2023.102052
Gitik RJoskowicz L(2023)Half-plane point retrieval queries with independent and dependent geometric uncertaintiesComputational Geometry10.1016/j.comgeo.2023.102021(102021)Online publication date: Jun-2023
https://doi.org/10.1016/j.comgeo.2023.102021
Gitik RJoskowicz L(2022)Voronoi Diagram and Delaunay Triangulation with Independent and Dependent Geometric UncertaintiesInternational Journal of Computational Geometry & Applications10.1142/S021819592150005931:02n03(75-121)Online publication date: 25-Jan-2022
https://doi.org/10.1142/S0218195921500059
Cabello SChan T(2022)Computing Shapley Values in the PlaneDiscrete & Computational Geometry10.1007/s00454-021-00368-367:3(843-881)Online publication date: 22-Feb-2022
https://doi.org/10.1007/s00454-021-00368-3
Gitik RBartal OJoskowicz L(2021)Euclidean minimum spanning trees with independent and dependent geometric uncertaintiesComputational Geometry10.1016/j.comgeo.2020.101744(101744)Online publication date: Jan-2021
https://doi.org/10.1016/j.comgeo.2020.101744
Caraballo LPérez-Lantero PSeara CVentura I(2021)Maximum Box Problem on Stochastic PointsAlgorithmica10.1007/s00453-021-00882-zOnline publication date: 28-Oct-2021
https://doi.org/10.1007/s00453-021-00882-z
Carmi PChanchary FMaheshwari ASmid M(2020)The Most Likely Object to be Seen Through a WindowInternational Journal of Computational Geometry & Applications10.1142/S021819591950009229:04(269-287)Online publication date: 6-May-2020
https://doi.org/10.1142/S0218195919500092
Mahmoud HIsmail TDarweesh M(2020)Dynamic Traffic Model With Optimal Gateways Placement in IP Cloud Heterogeneous CRANIEEE Access10.1109/ACCESS.2020.30044218(119062-119070)Online publication date: 2020
https://doi.org/10.1109/ACCESS.2020.3004421
Keikha VLöffler MMohades A(2020)A Fully Polynomial Time Approximation Scheme for the Smallest Diameter of Imprecise PointsTheoretical Computer Science10.1016/j.tcs.2020.02.006Online publication date: Feb-2020
https://doi.org/10.1016/j.tcs.2020.02.006
Agrawal ALi YXue JJanardan R(2020)The most-likely skyline problem for stochastic pointsComputational Geometry10.1016/j.comgeo.2020.101609(101609)Online publication date: Jan-2020
https://doi.org/10.1016/j.comgeo.2020.101609
Show More Cited By

View Options

Get Access

Login options

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

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Media

Figures

Other

Tables

View Table of Contents