Low-Degree Minimum Spanning Trees (1999)
| Venue: | Discrete Comput. Geom |
| Citations: | 19 - 0 self |
BibTeX
@ARTICLE{Robins99low-degreeminimum,
author = {Gabriel Robins and Jeffrey S. Salowe},
title = {Low-Degree Minimum Spanning Trees},
journal = {Discrete Comput. Geom},
year = {1999},
volume = {14},
pages = {151--165}
}
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Motivated by practical VLSI routing applications, we study the maximum vertex degree of a minimum spanning tree (MST). We prove that under the Lp norm, the maximum vertex degree over all MSTs is equal to the Hadwiger number of the corresponding unit ball; we show an even tighter bound for MSTs where the maximum degree is minimized. We give the best-known bounds for the maximum MST degree for arbitrary Lp metrics in all dimensions, with a focus on the rectilinear metric in two and three dimensions. We show that for any finite set of points in the rectilinear plane there exists an MST with maximum degree of at most 4, and for three-dimensional rectilinear space the maximum possible degree of a minimum-degree MST is either 13 or 14. 1 Introduction Minimum spanning tree (MST) construction is a classic optimization problem for which several efficient algorithms are known [9] [15] [19]. Solutions of many other problems hinge on the construction of an MST as an intermediary step [4], with th...
