Lower Bounds on the Dilation of Plane Spanners

被引:4
|
作者
Dumitrescu, Adrian [1 ]
Ghosh, Anirban [1 ]
机构
[1] Univ Wisconsin, Dept Comp Sci, Milwaukee, WI 53201 USA
关键词
Geometric graph; Plane spanner; Stretch factor; STRETCH FACTOR; DELAUNAY TRIANGULATIONS; GRAPHS; DETOUR;
D O I
10.1007/978-3-319-29221-2_12
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
(I) We exhibit a set of 23 points in the plane that has dilation at least 1.4308, improving the previously best lower bound of 1.4161 for the worst-case dilation of plane spanners. (II) For every n >= 13, there exists an n-element point set S such that the degree 3 dilation of S denoted by delta(0)(S, 3) equals 1+root 3 = 2.7321... in the domain of plane geometric spanners. In the same domain, we show that for every n >= 6, there exists a an n-element point set S such that the degree 4 dilation of S denoted by delta(0)(S, 4) equals 1+ root(5-root 5)/2 = 2.1755... The previous best lower bound of 1.4161 holds for any degree. (III) For every n >= 6, there exists an n-element point set S such that the stretch factor of the greedy triangulation of S is at least 2.0268.
引用
收藏
页码:139 / 151
页数:13
相关论文
共 50 条
  • [1] Lower bounds for additive spanners, emulators, and more
    Woodruff, David P.
    [J]. 47TH ANNUAL IEEE SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE, PROCEEDINGS, 2006, : 389 - 398
  • [2] A Hierarchy of Lower Bounds for Sublinear Additive Spanners
    Abboud, Amir
    Bodwin, Greg
    Pettie, Seth
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 568 - 576
  • [3] A HIERARCHY OF LOWER BOUNDS FOR SUBLINEAR ADDITIVE SPANNERS
    Abboud, Amir
    Bodwin, Greg
    Pettie, Seth
    [J]. SIAM JOURNAL ON COMPUTING, 2018, 47 (06) : 2203 - 2236
  • [4] Lower bounds for computing geometric spanners and approximate shortest paths
    Chen, DZ
    Das, G
    Smid, H
    [J]. DISCRETE APPLIED MATHEMATICS, 2001, 110 (2-3) : 151 - 167
  • [5] Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
    Chlamtac, Eden
    Dinitz, Michael
    Kortsarz, Guy
    Laekhanukit, Bundit
    [J]. PROCEEDINGS OF THE TWENTY-EIGHTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2017, : 534 - 553
  • [6] Approximating Spanners and Directed Steiner Forest: Upper and Lower Bounds
    Chlamtac, Eden
    Dinitz, Michael
    Kortsarz, Guy
    Laekhanukit, Bundit
    [J]. ACM TRANSACTIONS ON ALGORITHMS, 2020, 16 (03)
  • [7] Having Hope in Hops: New Spanners, Preservers and Lower Bounds for Hopsets
    Kogan, Shimon
    Parter, Merav
    [J]. 2022 IEEE 63RD ANNUAL SYMPOSIUM ON FOUNDATIONS OF COMPUTER SCIENCE (FOCS), 2022, : 766 - 777
  • [8] Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
    Yefim Dinitz
    Michael Elkin
    Shay Solomon
    [J]. Discrete & Computational Geometry, 2010, 43 : 736 - 783
  • [9] LOWER BOUNDS ON SPARSE SPANNERS, EMULATORS, AND DIAMETER-REDUCING SHORTCUTS
    Huang, Shang-En
    Pettie, Seth
    [J]. SIAM JOURNAL ON DISCRETE MATHEMATICS, 2021, 35 (03) : 2129 - 2144
  • [10] Low-Light Trees, and Tight Lower Bounds for Euclidean Spanners
    Dinitz, Yefim
    Elkin, Michael
    Solomon, Shay
    [J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2010, 43 (04) : 736 - 783