Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
Pages 311 - 327
Abstract
Inspired by the seminal works of Khuller et al. (SIAM J. Comput. 25(2), 355–368 (1996)) and Chan (Discrete Comput. Geom. 32(2), 177–194 (2004)) we study the bottleneck version of the Euclidean bounded-degree spanning tree problem. A bottleneck spanning tree is a spanning tree whose largest edge-length is minimum, and a bottleneck degree-K spanning tree is a degree-K spanning tree whose largest edge-length is minimum. Let be the supremum ratio of the largest edge-length of the bottleneck degree-K spanning tree to the largest edge-length of the bottleneck spanning tree, over all finite point sets in the Euclidean plane. It is known that , and it is easy to verify that , , and . It is implied by the Hamiltonicity of the cube of the bottleneck spanning tree that . The degree-3 spanning tree algorithm of Ravi et al. (25th Annual ACM Symposium on Theory of Computing, pp. 438–447. ACM, New York (1993)) implies that . Andersen and Ras (Networks 68(4), 302–314 (2016)) showed that . We present the following improved bounds: , , and . As a result, we obtain better approximation algorithms for Euclidean bottleneck degree-3 and degree-4 spanning trees. As parts of our proofs of these bounds we present some structural properties of the Euclidean minimum spanning tree which are of independent interest.
References
[1]
Abu-Affash AK, Biniaz A, Carmi P, Maheshwari A, and Smid M Approximating the bottleneck plane perfect matching of a point set Comput. Geom. 2015 48 9 718-731
[2]
Andersen PJ and Ras CJ Minimum bottleneck spanning trees with degree bounds Networks 2016 68 4 302-314
[3]
Andersen PJ and Ras CJ Algorithms for Euclidean degree bounded spanning tree problems Internat. J. Comput. Geom. Appl. 2019 29 2 121-160
[4]
Andersen PJ and Ras CJ Degree bounded bottleneck spanning trees in three dimensions J. Comb. Optim. 2020 39 2 457-491
[5]
Angelini P, Bruckdorfer T, Chiesa M, Frati F, Kaufmann M, and Squarcella C On the area requirements of Euclidean minimum spanning trees Comput. Geom. 2014 47 2B 200-213
[6]
Arkin EM, Fekete SP, Islam K, Meijer H, Mitchell JSB, Núñez-Rodríguez Y, Polishchuk V, Rappaport D, and Xiao H Not being (super)thin or solid is hard: a study of grid Hamiltonicity Comput. Geom. 2009 42 6–7 582-605
[7]
Camerini PM The min-max spanning tree problem and some extensions Inf. Process. Lett. 1978 7 1 10-14
[8]
Caragiannis, I., Kaklamanis, C., Kranakis, E., Krizanc, D., Wiese, A.: Communication in wireless networks with directional antennas. In: 20th Annual ACM Symposium on Parallelism in Algorithms and Architectures (Munich 2008), pp. 344–351. ACM, New York (2008)
[9]
Chan TM Euclidean bounded-degree spanning tree ratios Discrete Comput. Geom. 2004 32 2 177-194
[10]
Cormen TH, Leiserson ChE, and Rivest RL Introduction to Algorithms 1990 Cambridge MIT Press
[11]
Dobrev, S., Kranakis, E., Krizanc, D., Opatrny, J., Ponce, O.M., Stacho, L.: Strong connectivity in sensor networks with given number of directional antennae of bounded angle. Discrete Math. Algorithms Appl. 4(3), # 1250038 (2012)
[12]
Dobrev, S., Kranakis, E., Morales Ponce, O., Plžík, M.: Robust sensor range for constructing strongly connected spanning digraphs in UDGs. In: Computer Science—Theory and Applications (7th International Computer Science Symposium in Russia (Nizhny Novgorod 2012)). Lecture Notes in Comput. Sci., vol. 7353, pp. 112–124. Springer, Heidelberg (2012)
[13]
Fekete SP, Khuller S, Klemmstein M, Raghavachari B, and Young N A network-flow technique for finding low-weight bounded-degree spanning trees J. Algorithms 1997 24 2 310-324
[14]
Fleischner H The square of every two-connected graph is Hamiltonian J. Comb. Theory Ser. B 1974 16 29-34
[15]
Francke, A., Hoffmann, M.: The Euclidean degree-4 minimum spanning tree problem is NP-hard. In: 25th ACM Symposium on Computational Geometry (Aarhus 2009), pp. 179–188. ACM, New York (2009)
[16]
Itai, A., Papadimitriou, Ch.H., Szwarcfiter, J.L.: Hamilton paths in grid graphs. SIAM J. Comput. 11(4), 676–686 (1982)
[17]
Jothi R and Raghavachari B Degree-bounded minimum spanning trees Discrete Appl. Math. 2009 157 5 960-970
[18]
Karaganis JJ On the cube of a graph Can. Math. Bull. 1968 11 2 295-296
[19]
Khuller S, Raghavachari B, and Young N Low-degree spanning trees of small weight SIAM J. Comput. 1996 25 2 355-368
[20]
Lesniak L Graphs with -Hamiltonian-connected cubes J. Comb. Theory Ser. B 1973 14 148-152
[21]
Monma C and Suri S Transitions in geometric minimum spanning trees Discrete Comput. Geom. 1992 8 3 265-293
[22]
Papadimitriou, Ch.H.: The Euclidean traveling salesman problem is NP-complete. Theoret. Comput. Sci. 4(3), 237–244 (1977)
[23]
Papadimitriou, Ch.H., Vazirani, U.V.: On two geometric problems related to the travelling salesman problem. J. Algorithms 5(2), 231–246 (1984)
[24]
Parker RG and Rardin RL Guaranteed performance heuristics for the bottleneck traveling salesman problem Oper. Res. Lett. 1984 2 6 269-272
[25]
Ravi, R., Marathe, M.V., Ravi, S.S., Rosenkrantz, D.J., Hunt, H.B.: Many birds with one stone: multi-objective approximation algorithms. In: 25th Annual ACM Symposium on Theory of Computing (San Diego 1993), pp. 438–447. ACM, New York (1993)
[26]
Zbarsky S On improved bounds for bounded degree spanning trees for points in arbitrary dimension Discrete Comput. Geom. 2014 51 2 427-437
Index Terms
- Euclidean Bottleneck Bounded-Degree Spanning Tree Ratios
Index terms have been assigned to the content through auto-classification.
Recommendations
Euclidean bottleneck bounded-degree spanning tree ratios
SODA '20: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete AlgorithmsInspired by the seminal works of Khuller et al. (STOC 1994) and Chan (SoCG 2003) we study the bottleneck version of the Euclidean bounded-degree spanning tree problem. A bottleneck spanning tree is a spanning tree whose largest edge-length is minimum, ...
The Euclidean Bottleneck Full Steiner Tree Problem
Given two sets in the plane, R of n (terminal) points and S of m (Steiner) points, a full Steiner tree is a Steiner tree in which all points of R are leaves. In the bottleneck full Steiner tree (BFST) problem, one has to find a full Steiner ...
Degree-bounded minimum spanning tree for unit disk graph
Degree-bounded minimum spanning tree (DBMST) has been widely used in many applications of wireless sensor networks, such as data aggregation, topology control, etc. However, before construction of DBMST, it is NP-hard to determine whether or not there ...
Comments
Information & Contributors
Information
Published In
© The Author(s), under exclusive licence to Springer Science+Business Media, LLC part of Springer Nature 2021.
Publisher
Springer-Verlag
Berlin, Heidelberg
Publication History
Published: 01 January 2022
Accepted: 03 February 2021
Revision received: 08 November 2020
Received: 17 February 2020
Author Tags
Qualifiers
- Research-article
Funding Sources
Contributors
Other Metrics
Bibliometrics & Citations
Bibliometrics
Article Metrics
- 0Total Citations
- 0Total Downloads
- Downloads (Last 12 months)0
- Downloads (Last 6 weeks)0
Reflects downloads up to 05 Jan 2025