The complexity of restricted minimum spanning tree problems
- 1 January 1979
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 460-470
- https://doi.org/10.1007/3-540-09510-1_36
Abstract
No abstract availableKeywords
This publication has 7 references indexed in Scilit:
- The complexity of the capacitated tree problemNetworks, 1978
- Matroid intersection algorithmsMathematical Programming, 1975
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- Matroids and the greedy algorithmMathematical Programming, 1971
- Paths, Trees, and FlowersCanadian Journal of Mathematics, 1965
- Shortest Connection Networks And Some GeneralizationsBell System Technical Journal, 1957
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956