Two Matching Based Algorithm for Tree Network Design

DOI10.1080/02522667.1994.10699182zbMath0804.90120OpenAlexW1987793273MaRDI QIDQ4297157

Zhuolin Yu, Kemal Altinkemer

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

zbMATH Keywords

heuristicNP-completelocal access tree network designparallel saving algorithm

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Communication networks in operations research (90B18) Network design and communication in computer systems (68M10)

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

This page was built for publication: Two Matching Based Algorithm for Tree Network Design