Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\)

DOI10.1007/s10898-012-9967-3zbMath1286.90157OpenAlexW2164732056MaRDI QIDQ2434638

Yanyan Li

Publication date: 6 February 2014

Published in: Journal of Global Optimization (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10898-012-9967-3

zbMATH Keywords

approximation algorithmsubdivisionpackingSteiner treespecific material

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Steiner tree problem with minimum number of Steiner points and bounded edge-length
• A proof of the Gilbert-Pollak conjecture on the Steiner ratio
• The Steiner tree problem
• Combinatorial optimization. Polyhedra and efficiency (3 volumes)
• The Steiner ratio Gilbert-Pollak conjecture is still open
• On Minimum Cost Networks with Nonlinear Costs
• The Complexity of Computing Steiner Minimal Trees
• Steiner Minimal Trees
• Approximations for Steiner trees with minimum number of Steiner points
• Steiner tree problems

This page was built for publication: Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\)