Survivable network design: the capacitated minimum spanning network problem

DOI10.1016/j.ipl.2004.04.007zbMath1177.68026OpenAlexW2108872758MaRDI QIDQ2390307

Raja Jothi, Balaji Raghavachari

Publication date: 21 July 2009

Published in: Information Processing Letters (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.ipl.2004.04.007

zbMATH Keywords

combinatorial optimizationapproximation algorithmsaccess network design2-connectivity

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Graph theory (including graph drawing) in computer science (68R10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Approximation algorithms (68W25)

Related Items (2)

The \((K, k)\)-capacitated spanning tree problem ⋮ Approximation algorithms for solving the line-capacitated minimum Steiner tree problem

Cites Work

• Unnamed Item
• Heuristics for unequal weight delivery problems with a fixed error guarantee
• On the relationship between the biconnectivity augmentation and traveling salesman problems
• A composite very large-scale neighborhood structure for the capacitated minimum spanning tree problem.
• Heuristics with Constant Error Guarantees for the Design of Tree Networks
• The complexity of the capacitated tree problem
• Biconnectivity approximations and graph carvings
• A tabu search algorithm for the Capacitated Shortest Spanning Tree Problem
• Automata, Languages and Programming

This page was built for publication: Survivable network design: the capacitated minimum spanning network problem