An 11/6-approximation algorithm for the network steiner problem
- 1 May 1993
- journal article
- research article
- Published by Springer Nature in Algorithmica
- Vol. 9 (5) , 463-470
- https://doi.org/10.1007/bf01187035
Abstract
No abstract availableKeywords
This publication has 4 references indexed in Scilit:
- A faster approximation algorithm for the Steiner problem in graphsInformation Processing Letters, 1988
- Steiner problem in networks: A surveyNetworks, 1987
- A fast algorithm for Steiner treesActa Informatica, 1981
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972