Chapter 9 Optimal trees
- 1 January 1995
- book chapter
- Published by Elsevier BV
- Vol. 7, 503-615
- https://doi.org/10.1016/s0927-0507(05)80126-4
Abstract
No abstract availableThis publication has 46 references indexed in Scilit:
- An 11/6-approximation algorithm for the network steiner problemAlgorithmica, 1993
- A catalog of steiner tree formulationsNetworks, 1993
- Steiner tree problemsNetworks, 1992
- Easy problems for tree-decomposable graphsJournal of Algorithms, 1991
- Using separation algorithms to generate mixed integer model reformulationsOperations Research Letters, 1991
- A Lagrangean approach to the degree-constrained minimum spanning tree problemEuropean Journal of Operational Research, 1989
- An SST‐based algorithm for the steiner problem in graphsNetworks, 1989
- Steiner problem in networks: A surveyNetworks, 1987
- Formulations and Algorithms for the Capacitated Minimal Directed Tree ProblemJournal of the ACM, 1983
- Linear-time computability of combinatorial problems on series-parallel graphsJournal of the ACM, 1982