A Lower Bound for the Steiner Tree Problem

DOI10.1137/0134003zbMATH Open0376.05020OpenAlexW2085655777MaRDI QIDQ4154572FDOQ4154572

Fan 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)

Cited In (14)

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

This page was built for publication: A Lower Bound for the Steiner Tree Problem

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4154572)