Heuristics with Constant Error Guarantees for the Design of Tree Networks
From MaRDI portal
Publication:3780780
DOI10.1287/mnsc.34.3.331zbMath0639.90096MaRDI QIDQ3780780
Bezalel Gavish, Kemal Altinkemer
Publication date: 1988
Published in: Management Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1287/mnsc.34.3.331
NP-complete; network design; efficient heuristic; partitioning of a traveling salesman tour; spanning tree network of minimum length
90C35: Programming involving graphs or networks
05C05: Trees
65K05: Numerical mathematical programming methods
Related Items
Two Matching Based Algorithm for Tree Network Design, Topological design of telecommunication networks --- local access design methods, Dynamic programming based heuristics for the topological design of local access networks, Topological design of computer communication networks -- the overall design problem, Analysis of heuristics for the design of tree networks, Algorithms for a multi-level network optimization problem, Topological design of a centralized communication network with unreliable links and node outage costs, Hybrid fiber co-axial CATV network design with variable capacity optical network units, Heuristic procedure neural networks for the CMST problem, A multiperiod planning model for the capacitated minimal spanning tree problem, Heuristics with Constant Error Guarantees for the Multi Center Capacitated Minimum Spanning Tree Problem
