Spanning Trees and Spanners

Spanning Trees and Spanners (1996)

by David Eppstein

Citations:

118 - 2 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Spanning Trees and Spanners	SVM HeaderParse 0.1
AUTHOR NAME	David Eppstein	user correction - Legacy Corrections
ABSTRACT	We survey results in geometric network design theory, including algorithms for constructing minimum spanning trees and low-dilation graphs. 1 Introduction This survey covers topics in geometric network design theory. The problem is easy to state: connect a collection of sites by a "good" network. For instance, one may wish to connect components of a VLSI circuit by networks of wires, in a way that uses little surface area on the chip, draws little power, and propagates signals quickly. Similar problems come up in other applications such as telecommunications, road network design, and medical imaging [1]. One network design problem, the Traveling Salesman problem, is sufficiently important to have whole books devoted to it [79]. Problems involving some form of geometric minimum or maximum spanning tree also arise in the solution of other geometric problems such as clustering [12], mesh generation [56], and robot motion planning [93]. One can vary the network design problem in many w...	user correction - Legacy Corrections
YEAR	1996	user correction - Legacy Corrections
CITATIONS	116 found	ParsCit 1.0