Topological design of centralized computer networks—formulations and algorithms
- 1 December 1982
- Vol. 12 (4), 355-377
- https://doi.org/10.1002/net.3230120402
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- The complexity of the capacitated tree problemNetworks, 1978
- A good algorithm for smallest spanning trees with a degree constraintNetworks, 1978
- Network Design: An Algorithm for the Access Facility Location ProblemIEEE Transactions on Communications, 1977
- Large-Scale Network Topological OptimizationIEEE Transactions on Communications, 1977
- Topological Design of Multipoint Teleprocessing NetworksIEEE Transactions on Communications, 1974
- Computing capacitated minimal spanning trees efficientlyNetworks, 1974
- The Capacitated Minimum Spanning TreeNetworks, 1973
- Algorithm 422: minimal spanning tree [H]Communications of the ACM, 1972
- Partitioning procedures for solving mixed-variables programming problemsNumerische Mathematik, 1962
- A note on two problems in connexion with graphsNumerische Mathematik, 1959