On greedy heuristic for Steiner minimum trees
From MaRDI portal
Publication:1891232
DOI10.1007/BF01293486zbMath0827.68086OpenAlexW2022498554MaRDI QIDQ1891232
Publication date: 30 May 1995
Published in: Algorithmica (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/bf01293486
Cites Work
- A variational approach to the Steiner network problem
- The Steiner ratio conjecture for six points
- A proof of the Gilbert-Pollak conjecture on the Steiner ratio
- Steiner tree problems
- Some remarks on the Steiner problem
- An 11/6-approximation algorithm for the network Steiner problem
- A New Bound for the Steiner Ratio
- A Lower Bound for the Steiner Tree Problem
- The Complexity of Computing Steiner Minimal Trees
- Improved Approximations for the Steiner Tree Problem
- Steiner Minimal Trees
- Unnamed Item
- Unnamed Item
- Unnamed Item
This page was built for publication: On greedy heuristic for Steiner minimum trees
