Bounded diameter minimum spanning trees and related problems

Authors:
J. M. Ho;D. T. Lee
Affiliations:
Northwestern University;Northwestern University
Venue:
SCG '89 Proceedings of the fifth annual symposium on Computational geometry
Year:
1989

Citing 2
Cited 5

Optimal point location in a monotone subdivision

SIAM Journal on Computing
Computers and Intractability: A Guide to the Theory of NP-Completeness

Computers and Intractability: A Guide to the Theory of NP-Completeness

Delay bounded buffered tree construction for timing driven floorplanning

ICCAD '97 Proceedings of the 1997 IEEE/ACM international conference on Computer-aided design
Constructing Minimal Spanning/Steiner Trees with Bounded Path Length

EDTC '96 Proceedings of the 1996 European conference on Design and Test
Evaluating Steiner-tree heuristics and diameter variations for application layer multicast

Computer Networks: The International Journal of Computer and Telecommunications Networking
Constructing minimal spanning/Steiner trees with bounded path length

Integration, the VLSI Journal
Multichannel scheduling and spanning trees: throughput-delay tradeoff for fast data collection in sensor networks

IEEE/ACM Transactions on Networking (TON)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We consider the problem of finding a minimum diameter spanning tree (MDST) of a set of n points in the Euclidean plane. The diameter of a spanning tree is the maximum distance between any two points in the tree. We give a characterization of an MDST and present a &thgr;(n3 time algorithm for solving the problem. We also show that for a weighted undirected graph, the problem of determining if a spanning tree with total weight and diameter upper bounded, respectively, by two given parameters C and D exists is N P-complete. The geometrical minimum diameter Steiner tree problem, in which new points are allowed to be part of the spanning tree, is shown to be solvable in &Ogr;(n) time.