The complexity of the capacitated tree problem
- 1 September 1978
- Vol. 8 (3), 217-230
- https://doi.org/10.1002/net.3230080306
Abstract
No abstract availableKeywords
This publication has 11 references indexed in Scilit:
- Some NP-complete geometric problemsPublished by Association for Computing Machinery (ACM) ,1976
- An 0(|E|loglog|V|) algorithm for finding minimum spanning treesInformation Processing Letters, 1975
- Computing capacitated minimal spanning trees efficientlyNetworks, 1974
- The Capacitated Minimum Spanning TreeNetworks, 1973
- The Design or Multipoint Linkages in a Teleprocessing Tree NetworkIEEE Transactions on Computers, 1972
- Reducibility among Combinatorial ProblemsPublished by Springer Nature ,1972
- The Design of Minimum-Cost Survivable NetworksIEEE Transactions on Circuit Theory, 1969
- On teleprocessing system design, Part II: A method for approximating the optimal networkIBM Systems Journal, 1966
- The shortest path through many pointsMathematical Proceedings of the Cambridge Philosophical Society, 1959
- On the shortest spanning subtree of a graph and the traveling salesman problemProceedings of the American Mathematical Society, 1956