A Lower Bound for the Steiner Tree Problem

DOI10.1137/0134003zbMath0376.05020OpenAlexW2085655777MaRDI QIDQ4154572

Fan R. K. Chung, Frank K. Hwang

Publication date: 1978

Published in: SIAM Journal on Applied Mathematics (Search for Journal in Brave)

Full work available at URL: https://semanticscholar.org/paper/a795a60060290b92736a794965ac60913cf2e387

Mathematics Subject Classification ID

Trees (05C05) Extremal problems in graph theory (05C35)

Related Items

A continuous version of a result of Du and Hwang, On greedy heuristic for Steiner minimum trees, On the Steiner ratio in 3-space, A New Bound for the Steiner Ratio, Unnamed Item, A primer of the Euclidean Steiner problem, On Steiner ratio conjectures, Minimal length tree networks on the unit sphere, A proof of the Gilbert-Pollak conjecture on the Steiner ratio, On Steiner minimal trees with \(L_ p\) distance, ON CHARACTERISTIC AREA OF STEINER TREE, On better heuristics for Steiner minimum trees, Euclidean Steiner minimal trees, minimum energy configurations, and the embedding problem of weighted graphs in \(E^ 3\), The Steiner ratio conjecture is true for five points