Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/2488608.2488691acmconferencesArticle/Chapter ViewAbstractPublication PagesstocConference Proceedingsconference-collections
research-article

Optimal euclidean spanners: really short, thin and lanky

Published: 01 June 2013 Publication History

Abstract

The degree, the (hop-)diameter, and the weight are the most basic and well-studied parameters of geometric spanners. In a seminal STOC'95 paper, titled "Euclidean spanners: short, thin and lanky", Arya et al. [2] devised a construction of Euclidean (1+ε)-spanners that achieves constant degree, diameter O(log n), weight O(log2 n) ⋅ ω(MST), and has running time O(n ⋅ log n). This construction applies to n-point constant-dimensional Euclidean spaces. Moreover, Arya et al. conjectured that the weight bound can be improved by a logarithmic factor, without increasing the degree and the diameter of the spanner, and within the same running time.
This conjecture of Arya et al. became one of the most central open problems in the area of Euclidean spanners. Nevertheless, the only progress since 1995 towards its resolution was achieved in the lower bounds front: Any spanner with diameter O(log n) must incur weight Ω(log n) ⋅ ω(MST), and this lower bound holds regardless of the stretch or the degree of the spanner [12, 1].
In this paper we resolve the long-standing conjecture of Arya et al. in the affirmative. We present a spanner construction with the same stretch, degree, diameter, and running time, as in Arya et al.'s result, but with optimal weight O(log n) ⋅ ω(MST). So our spanners are as thin and lanky as those of Arya et al., but they are really short!
Moreover, our result is more general in three ways. First, we demonstrate that the conjecture holds true not only in constant-dimensional Euclidean spaces, but also in doubling metrics. Second, we provide a general tradeoff between the three involved parameters, which is tight in the entire range. Third, we devise a transformation that decreases the lightness of spanners in general metrics, while keeping all their other parameters in check. Our main result is obtained as a corollary of this transformation.

References

[1]
P. K. Agarwal, Y. Wang, and P. Yin. Lower bound for sparse Euclidean spanners. In Proc. of 16th SODA, pages 670--671, 2005.
[2]
S. Arya, G. Das, D. M. Mount, J. S. Salowe, and M. H. M. Smid. Euclidean spanners: short, thin, and lanky. In Proc. of 27th STOC, pages 489--498, 1995.
[3]
S. Arya, D. M. Mount, and M. H. M. Smid. Randomized and deterministic algorithms for geometric spanners of small diameter. In Proc. of 35th FOCS, pages 703--712, 1994.
[4]
Y. Bartal, L. Gottlieb, and R. Krauthgamer. The traveling salesman problem: low-dimensionality implies a polynomial time approximation scheme. In Proc. of 44th STOC, pages 663--672, 2012.
[5]
H. T.-H. Chan and A. Gupta. Small hop-diameter sparse spanners for doubling metrics. In Proc. of 17th SODA, pages 70--78, 2006.
[6]
H. T.-H. Chan, A. Gupta, B. M. Maggs, and S. Zhou. On hierarchical routing in doubling metrics. In Proc. of 16th SODA, pages 762--771, 2005.
[7]
T.-H. H. Chan, M. Li, and L. Ning. Incubators vs zombies: Fault-tolerant, short, thin and lanky spanners for doubling metrics. Tech. Rep., CoRR, abs/1207.0892, July, 2012.
[8]
B. Chandra, G. Das, G. Narasimhan, and J. Soares. New sparseness results on graph spanners. In Proc. of 8th SOCG, pages 192--201, 1992.
[9]
D. Z. Chen, G. Das, and M. H. M. Smid. Lower bounds for computing geometric spanners and approximate shortest paths. Discrete Applied Mathematics, 110(2--3):151--167, 2001.
[10]
L. P. Chew. There is a planar graph almost as good as the complete graph. In Proc. of 2nd SOCG, pages 169--177, 1986.
[11]
G. Das and G. Narasimhan. A fast algorithm for constructing sparse Euclidean spanners. In Proc. of 10th SOCG, pages 132--139, 1994.
[12]
Y. Dinitz, M. Elkin, and S. Solomon. Shallow-low-light trees, and tight lower bounds for Euclidean spanners. In Proc. of 49th FOCS, pages 519--528, 2008.
[13]
M. Elkin and S. Solomon. Optimal Euclidean spanners: really short, thin and lanky. Tech. Rep. CS12-04, Ben-Gurion University (April, 2012). Also Tech. Rep. CoRR, abs/1207.1831 (July, 2012).
[14]
M. Elkin and S. Solomon. Fast constructions of light-weight spanners for general graphs. In Proc. of 24th SODA, pages 513--525, 2013.
[15]
L. Gottlieb, A. Kontorovich, and R. Krauthgamer. Efficient regression in metric space via approximate lipschitz extension. Manuscript, 2012.
[16]
L. Gottlieb and L. Roditty. Improved algorithms for fully dynamic geometric spanners and geometric routing. In Proc. of 19th SODA, pages 591--600, 2008.
[17]
L. Gottlieb and L. Roditty. An optimal dynamic spanner for doubling metric spaces. In Proc. of 16th ESA, pages 478--489, 2008.
[18]
J. Gudmundsson, C. Levcopoulos, and G. Narasimhan. Fast greedy algorithms for constructing sparse geometric spanners. SIAM J. Comput., 31(5):1479--1500, 2002.
[19]
A. Gupta, R. Krauthgamer, and J. R. Lee. Bounded geometries, fractals, and low-distortion embeddings. In Proc. of 44th FOCS, pages 534--543, 2003.
[20]
S. Har-Peled and M. Mendel. Fast construction of nets in low-dimensional metrics and their applications. SIAM J. Comput., 35(5):1148--1184, 2006.
[21]
G. Narasimhan and M. Smid. Geometric Spanner Networks. Cambridge University Press, 2007.
[22]
L. Roditty. Fully dynamic geometric spanners. In Proc. of 23rd SoCG, pages 373--380, 2007.
[23]
J. S. Salowe. On Euclidean spanner graphs with small degree. In Proc. of 8th SoCG, pages 186--191, 1992.
[24]
M. H. M. Smid. The weak gap property in metric spaces of bounded doubling dimension. In Proc. of Efficient Algorithms, pages 275--289, 2009.
[25]
S. Solomon. An Optimal-Time Construction of Sparse Euclidean Spanners with Tiny Diameter. In Proc. of 22nd SODA, pages 820--839, 2011.
[26]
S. Solomon. Fault-tolerant spanners for doubling metrics: Better and simpler. Tech. Rep., CoRR, abs/1207.7040, July, 2012.
[27]
S. Solomon and M. Elkin. Balancing degree, diameter and weight in Euclidean spanners. In Proc. of 18th ESA, pages 48--59, 2010.

Cited By

View all

Index Terms

  1. Optimal euclidean spanners: really short, thin and lanky

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    STOC '13: Proceedings of the forty-fifth annual ACM symposium on Theory of Computing
    June 2013
    998 pages
    ISBN:9781450320290
    DOI:10.1145/2488608
    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: 01 June 2013

    Permissions

    Request permissions for this article.

    Check for updates

    Author Tags

    1. doubling metrics
    2. euclidean spaces
    3. euclidean spanners

    Qualifiers

    • Research-article

    Conference

    STOC'13
    Sponsor:
    STOC'13: Symposium on Theory of Computing
    June 1 - 4, 2013
    California, Palo Alto, USA

    Acceptance Rates

    STOC '13 Paper Acceptance Rate 100 of 360 submissions, 28%;
    Overall Acceptance Rate 1,469 of 4,586 submissions, 32%

    Upcoming Conference

    STOC '25
    57th Annual ACM Symposium on Theory of Computing (STOC 2025)
    June 23 - 27, 2025
    Prague , Czech Republic

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)1
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 08 Feb 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2022)Local Routing Algorithms on Euclidean Spanners with Small DiameterLATIN 2022: Theoretical Informatics10.1007/978-3-031-20624-5_42(696-712)Online publication date: 29-Oct-2022
    • (2021)Local routing in a tree metric 1-spannerJournal of Combinatorial Optimization10.1007/s10878-021-00784-444:4(2642-2660)Online publication date: 23-Jul-2021
    • (2020)Local Routing in a Tree Metric 1-SpannerComputing and Combinatorics10.1007/978-3-030-58150-3_14(174-185)Online publication date: 27-Aug-2020
    • (2018)Near-Optimal Light SpannersACM Transactions on Algorithms10.1145/319960714:3(1-15)Online publication date: 22-Jun-2018
    • (2017)Localized Algorithms for Yao Graph-Based Spanner Construction in Wireless Networks Under SINRIEEE/ACM Transactions on Networking10.1109/TNET.2017.268848425:4(2459-2472)Online publication date: 1-Aug-2017
    • (2017)Distributed Spanner Construction With Physical InterferenceIEEE/ACM Transactions on Networking10.1109/TNET.2017.268483125:4(2138-2151)Online publication date: 1-Aug-2017
    • (2017)Efficient Regression in Metric Spaces via Approximate Lipschitz ExtensionIEEE Transactions on Information Theory10.1109/TIT.2017.271382063:8(4838-4849)Online publication date: Aug-2017
    • (2016)Near-optimal light spannersProceedings of the twenty-seventh annual ACM-SIAM symposium on Discrete algorithms10.5555/2884435.2884498(883-892)Online publication date: 10-Jan-2016
    • (2016)On Hierarchical Routing in Doubling MetricsACM Transactions on Algorithms10.1145/291518312:4(1-22)Online publication date: 16-Aug-2016
    • (2016)Geometric SpannersEncyclopedia of Algorithms10.1007/978-1-4939-2864-4_167(846-852)Online publication date: 22-Apr-2016
    • Show More Cited By

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Figures

    Tables

    Media

    Share

    Share

    Share this Publication link

    Share on social media