Tighter Bounds for Graph Steiner Tree Approximation
By Gabriel Robins, A. Zelikovsky. SIAM Journal on Discrete Mathematics, 2005
344 citations recorded by the source corpus.
Subfields: Computational Theory and Mathematics, Electrical and Electronic Engineering
View Paper: https://www.semanticscholar.org/paper/610ca25419e47a3e1b088e944277acadc2ecf6b5
How researchers see this paper
The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.
In Computational Theory and Mathematics
- David P. Williamson
- David B. Shmoys
- Fabrizio Grandoni
- Laura Sanità
- Thomas Rothvoss
- Jaroslaw Byrka
- Sariel Har-Peled
- Yaron Shaposhnik
In Electrical and Electronic Engineering
- David B. Shmoys
- David P. Williamson
- Kemal Akkaya
- Fabrizio Grandoni
- Laura Sanità
- Mohamed F. Younis
- Thomas Rothvoss
- Jaroslaw Byrka
Citations in the corpus
- Topology management techniques for tolerating node failures in wireless sensor networks: A survey (2014, methodology): “In order to find a topology which reduces the node count, DORMS employs k-LCA [86], which is the best known approximation algorithm for finding an SMT.”
- An improved LP-based approximation for steiner tree (2010, methodology): “A more technical analysis, based on an adaptation of the analysis of Robins and Zelikovsky which exploits our Bridge Lemma, leads to the following improved result (see Section 5).”
- The Design of Approximation Algorithms (2011, methodology): “55-approximation algorithm due to Robins and Zelikovsky [254], which is a greedy algorithm.”