Low-Degree Spanning Trees of Small Weight
Abstract
Given n points in the plane, the degree-K spanning-tree problem asks for a spanning tree of minimum weight in which the degree of each vertex is at most K. This paper addresses the problem of computing low-weight degree-K spanning trees for $K > 2$. It is shown that for an arbitrary collection of n points in the plane, there exists a spanning tree of degree 3 whose weight is at most 1.5 times the weight of a minimum spanning tree. It is shown that there exists a spanning tree of degree 4 whose weight is at most 1.25 times the weight of a minimum spanning tree. These results solve open problems posed by Papadimitriou and Vazirani. Moreover, if a minimum spanning tree is given as part of the input, the trees can be computed in $O(n)$ time.
The results are generalized to points in higher dimensions. It is shown that for any $d \geqslant 3$, an arbitrary collection of points in $\Re ^d $ contains a spanning tree of degree 3 whose weight is at most ${5 / 3}$ times the weight of a minimum spanning tree. This is the first paper that achieves factors better than 2 for these problems.
MSC codes
Keywords
Get full access to this article
View all available purchase options and get full access to this article.
References
1.
J. L. Bentley, Communicated by David Johnson
2.
D. Bienstock, M. X. Goemans, D. Simchi-Levi, D. P. Williamson, A note on the prize collecting traveling salesman problem, Math. Programming, 59 (1993), 413–420
3.
N. Christofides, Worst-case analysis of a new heuristic for the traveling salesman problem, Tech. report, 388, Graduate School of Industrial Administration, Carnegie Mellon University, Pittsburgh, PA, 1975
4.
Gautam Das, Paul J. Heffernan, Constructing degree- 3 spanners with other sparseness propertiesAlgorithms and computation (Hong Kong, 1993), Lecture Notes in Comput. Sci., Vol. 762, Springer, Berlin, 1993, 11–20, Proc. 4th Annual International Symposium, New York
5.
D.-Z. Du, F. K. Hwang, A proof of the Gilbert-Pollak conjecture on the Steiner ratio, Algorithmica, 7 (1992), 121–135
6.
D.-Z. Du, Y. Zhang, Q. Feng, On better heuristic for Euclidean Steiner minimum trees, Proc. 32nd Annual Symposium on Foundations of Computer Science, IEEE Press, Piscataway, NJ, 1991, 431–439
7.
T. Fischer, Optimizing the degree of minimum weight spanning trees, Tech. report, 93-1338, Department of Computer Science, Cornell University, 1993, April
8.
G. N. Frederickson, J. JáJá, On the relationship between the biconnectivity augmentation and traveling salesman problems, Theoret. Comput. Sci., 19 (1982), 189–201
9.
Martin Fürer, Balaji Raghavachari, Approximating the minimum-degree Steiner tree to within one of optimal, J. Algorithms, 17 (1994), 409–423
10.
Michael R. Garey, David S. Johnson, Computers and intractability, W. H. Freeman and Co., San Francisco, Calif., 1979x+338, A guide to the theory of NP-completeness
11.
Michel X. Goemans, David P. Williamson, A general approximation technique for constrained forest problems, Proceedings of the Third Annual ACM-SIAM Symposium on Discrete Algorithms (Orlando, FL, 1992), ACM, New York, 1992, 307–316
Michel X. Goemans, David P. Williamson, A general approximation technique for constrained forest problems, SIAM J. Comput., 24 (1995), 296–317
12.
Alon Itai, Christos H. Papadimitriou, Jayme Luiz Szwarcfiter, Hamilton paths in grid graphs, SIAM J. Comput., 11 (1982), 676–686
13.
J. N. Lillington, Some extremal properties of convex sets, Math. Proc. Cambridge Philos. Soc., 77 (1975), 515–524
14.
Clyde Monma, Subhash Suri, Transitions in geometric minimum spanning trees, Discrete Comput. Geom., 8 (1992), 265–293
15.
Christos H. Papadimitriou, Umesh V. Vazirani, On two geometric problems related to the travelling salesman problem, J. Algorithms, 5 (1984), 231–246
16.
R. Ravi, M. V. Marathe, S. S. Ravi, D. J. Rosenkrantz, H. B. Hunt, III, Many birds with one stone: Multi-objective approximation algorithms, Proc. 25th Annual ACM Symposium on the Theory of Computing, Association for Computing Machinery, New York, 1993, 438–447
17.
G. Robins, J. S. Salowe, Low-degree minimum spanning trees, Discrete Comput. Geom., 14 (1995), 151–165, in Proc. 10th Annual ACM Symposium on Computational Geometry, Association for Computing Machinery, New York, 1994, pp. 250–258
18.
J. S. Salowe, Euclidean spanner graphs with degree four, Discrete Appl. Math., 54 (1994), 55–66, in Proc. 8th Annual ACM Symposium on Computational Geometry, Association for Computing Machinery, New York, 1992, pp. 186–191
Information & Authors
Information
Published In
SIAM Journal on Computing
Pages: 355 - 368
ISSN (online): 1095-7111
Copyright
Copyright © 1996 Society for Industrial and Applied Mathematics.
History
Submitted: 3 February 1994
Accepted: 31 August 1994
Published online: 13 July 2006
MSC codes
Keywords
Authors
Metrics & Citations
Metrics
Citations
If you have the appropriate software installed, you can download article citation data to the citation manager of your choice. Simply select your manager software from the list below and click Download.
Cited By
- A 1.5-Approximation for Symmetric Euclidean Open Loop TSPIEEE Access, Vol. 12 | 1 Jan 2024
- A 4-approximation of the 2π3 -MSTComputational Geometry, Vol. 108 | 1 Jan 2023
- Bounded-Angle Minimum Spanning TreesAlgorithmica, Vol. 84, No. 1 | 17 November 2021
- Euclidean Bottleneck Bounded-Degree Spanning Tree RatiosDiscrete & Computational Geometry, Vol. 67, No. 1 | 16 April 2021
- Ferromagnetically Shifting the Power of PausingPhysical Review Applied, Vol. 15, No. 4 | 6 April 2021
- A 4-Approximation of the $$\frac{2\pi }{3}$$-MSTAlgorithms and Data Structures | 31 July 2021
- The complexity of symmetric connectivity in directional wireless sensor networksJournal of Combinatorial Optimization, Vol. 39, No. 3 | 7 December 2019
- Degree bounded bottleneck spanning trees in three dimensionsJournal of Combinatorial Optimization, Vol. 39, No. 2 | 29 November 2019
- Algorithms for Euclidean Degree Bounded Spanning Tree ProblemsInternational Journal of Computational Geometry & Applications, Vol. 29, No. 02 | 20 September 2019
- Symmetric Connectivity Algotirthms in Multiple Directional Antennas Wireless Sensor NetworksIEEE INFOCOM 2018 - IEEE Conference on Computer Communications | 1 Apr 2018
- Bounded-Angle Spanning Tree: Modeling Networks with Angular ConstraintsAlgorithmica, Vol. 77, No. 2 | 5 October 2015
- Minimum bottleneck spanning trees with degree boundsNetworks, Vol. 68, No. 4 | 30 September 2016
- Binary Steiner trees: Structural results and an exact solution approachDiscrete Optimization, Vol. 21 | 1 Aug 2016
- Degree-Bounded TreesEncyclopedia of Algorithms | 22 April 2016
- Bounded-Angle Spanning Tree: Modeling Networks with Angular ConstraintsAutomata, Languages, and Programming | 1 Jan 2014
- Degree-bounded minimum spanning tree for unit disk graphTheoretical Computer Science, Vol. 418 | 1 Feb 2012
- Degree Bounded Network Design with Metric CostsSIAM Journal on Computing, Vol. 40, No. 4 | 7 July 2011
- A hybrid Lagrangian Particle Swarm Optimization Algorithm for the degree-constrained minimum spanning tree problemIEEE Congress on Evolutionary Computation | 1 Jul 2010
- Cooperative TSPTheoretical Computer Science, Vol. 411, No. 31-33 | 1 Jun 2010
- VNS and second order heuristics for the min-degree constrained minimum spanning tree problemComputers & Operations Research, Vol. 36, No. 11 | 1 Nov 2009
- A push–relabel approximation algorithm for approximating the minimum-degree MST problem and its generalization to matroidsTheoretical Computer Science, Vol. 410, No. 44 | 1 Oct 2009
- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTsAlgorithmica, Vol. 55, No. 1 | 10 November 2007
- The Euclidean degree-4 minimum spanning tree problem is NP-hardProceedings of the twenty-fifth annual symposium on Computational geometry | 8 June 2009
- Degree-bounded minimum spanning treesDiscrete Applied Mathematics, Vol. 157, No. 5 | 1 Mar 2009
- Approximation Algorithms for Degree-Constrained Minimum-Cost Network-Design ProblemsFundamental Problems in Computing | 1 Jan 2009
- A local search heuristic for bounded-degree minimum spanning treesEngineering Optimization, Vol. 40, No. 12 | 1 Dec 2008
- Degree-Bounded TreesEncyclopedia of Algorithms | 1 Jan 2008
- An effective ant-based algorithm for the degree-constrained minimum spanning tree problem2007 IEEE Congress on Evolutionary Computation | 1 Sep 2007
- Lower and upper bounds for the degree‐constrained minimum spanning tree problemNetworks, Vol. 50, No. 1 | 30 April 2007
- Using Lagrangian dual information to generate degree constrained spanning treesDiscrete Applied Mathematics, Vol. 154, No. 5 | 1 Apr 2006
- A Push-Relabel Algorithm for Approximating Degree Bounded MSTsAutomata, Languages and Programming | 1 Jan 2006
- Cooperative TSPAlgorithms – ESA 2006 | 1 Jan 2006
- What Would Edmonds Do? Augmenting Paths and Witnesses for Degree-Bounded MSTsApproximation, Randomization and Combinatorial Optimization. Algorithms and Techniques | 1 Jan 2005
- Topology formulation algorithms for wireless networks with reconfigurable directional linksMILCOM 2005 - 2005 IEEE Military Communications Conference | 1 Jan 2005
- Shortest-Paths TreesSpanning Trees and Optimization Problems | 27 Jan 2004
- An Efficient Low-Degree RMST Algorithm for VLSI/ULSI Physical DesignIntegrated Circuit and System Design. Power and Timing Modeling, Optimization and Simulation | 1 Jan 2004
- Euclidean bounded-degree spanning tree ratiosProceedings of the nineteenth annual symposium on Computational geometry | 8 June 2003
- Approximation Schemes for Degree-Restricted MST and Red-Blue Separation ProblemAutomata, Languages and Programming | 18 June 2003
- There Are Spanning Spiders in Dense Graphs (and We Know How to Find Them)Automata, Languages and Programming | 18 June 2003
- A Matter of Degree: Improved Approximation Algorithms for Degree-Bounded Minimum Spanning TreesSIAM Journal on Computing, Vol. 31, No. 6 | 17 February 2012
- Spanning Trees with Bounded Number of Branch VerticesAutomata, Languages and Programming | 25 June 2002
- Near-optimal bounded-degree spanning treesAlgorithmica, Vol. 29, No. 1-2 | 1 Feb 2001
- An Evolutionary Algorithm with Stochastic Hill-Climbing for the Edge-Biconnectivity Augmentation ProblemApplications of Evolutionary Computing | 6 April 2001
- A new evolutionary approach to the degree-constrained minimum spanning tree problemIEEE Transactions on Evolutionary Computation, Vol. 4, No. 2 | 1 Jul 2000
- A matter of degreeProceedings of the thirty-second annual ACM symposium on Theory of computing | 1 May 2000
- Spanning Trees and SpannersHandbook of Computational Geometry | 1 Jan 2000
- A parallel algorithm for the degree-constrained minimum spanning tree problem using nearest-neighbor chainsProceedings Fourth International Symposium on Parallel Architectures, Algorithms, and Networks (I-SPAN'99) | 1 Jan 1999
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problemsJournal of the ACM, Vol. 45, No. 5 | 1 September 1998
- A Network-Flow Technique for Finding Low-Weight Bounded-Degree Spanning TreesJournal of Algorithms, Vol. 24, No. 2 | 1 Aug 1997
- ProblemsJournal of Algorithms, Vol. 23, No. 2 | 1 May 1997
- Bounded degree spanning treesAlgorithms — ESA '97 | 30 July 2005
View Options
- Access via your Institution
- Questions about how to access this content? Contact SIAM at [email protected].