approximation bounds for the network and Euclidean Steiner tree problems (1996) [37 citations — 4 self]
Download:
|
|
by Alexander Zelikovsky
ftp://ftp.cs.virginia.edu/pub/techreports/CS-96-06.ps.Z
Add To MetaCart
Popular Tags
No tags have been applied to this document.
BibTeX | Add To MetaCart
@TECHREPORT{Zelikovsky96approximationbounds,author = {Alexander Zelikovsky},
title = {approximation bounds for the network and Euclidean Steiner tree problems},
institution = {},
year = {1996}
}
Years of Citing Articles
Abstract:
The network and Euclidean Steiner tree problems require a shortest tree spanning a given vertex subset within a network G = (V; E; d) and Euclidean plane, respectively. For these problems, we present a series of heuristics finding approximate Steiner tree with performance guarantee coming arbitrary close to 1+ln2 1:693 and 1+ln 2
