Second-Order Greedy Algorithms for Centralized Teleprocessing Network Design
Authors:
- A. KershenbaumAKA. Kershenbaum
- R. BoorstynRBR. Boorstyn
- R. OppenheimROR. Oppenheim
- 1 October 1980
- journal article
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 28 (10) , 1835-1838
Abstract
No abstract availableThis publication has 8 references indexed in Scilit:
- A New Class of Algorithms for Multipoint Network OptimizationIEEE Transactions on Communications, 1976
- A Unified Algorithm for Designing Multidrop Teleprocessing NetworksIEEE Transactions on Communications, 1974
- Topological Design of Multipoint Teleprocessing NetworksIEEE Transactions on Communications, 1974
- 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
- Optimal design of centralized computer networksNetworks, 1971
- On teleprocessing system design, Part II: A method for approximating the optimal networkIBM Systems Journal, 1966