Two Matching Based Algorithm for Tree Network Design
From MaRDI portal
Publication:4297157
DOI10.1080/02522667.1994.10699182zbMath0804.90120MaRDI QIDQ4297157
Publication date: 29 June 1994
Published in: Journal of Information and Optimization Sciences (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1080/02522667.1994.10699182
90C35: Programming involving graphs or networks
90B18: Communication networks in operations research
68M10: Network design and communication in computer systems
Cites Work
- Centralized teleprocessing network design
- Heuristics with Constant Error Guarantees for the Design of Tree Networks
- Topological design of centralized computer networks—formulations and algorithms
- Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
- Formulations and Algorithms for the Capacitated Minimal Directed Tree Problem
- The Capacitated Minimum Spanning Tree