Approximation algorithms for a capacitated network design problem

DOI10.1007/s00453-003-1069-7zbMath1138.90347OpenAlexW2120679858MaRDI QIDQ1879243

R. Ravi, F. Sibel Salman, Refael Hassin

Publication date: 22 September 2004

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00453-003-1069-7

zbMATH Keywords

Approximation algorithmsNetwork designCapacity installationRouting flow

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Deterministic network models in operations research (90B10) Approximation algorithms (68W25)

Related Items (11)

Approximating the Generalized Capacitated Tree-Routing Problem ⋮ Approximating capacitated tree-routings in networks ⋮ Exact Approaches for Designing Multifacility Buy-at-Bulk Networks ⋮ Approximation to the Minimum Cost Edge Installation Problem ⋮ Risk Based Optimization of Electronics Manufacturing Supply Chains ⋮ Approximation Schemes for Capacitated Geometric Network Design ⋮ Approximating the \(k\)-splittable capacitated network design problem ⋮ On the approximation of the generalized capacitated tree-routing problem ⋮ Approximation algorithms for soft-capacitated facility location in capacitated network design ⋮ Approximation algorithms for solving the line-capacitated minimum Steiner tree problem ⋮ Approximation Schemes for Capacitated Geometric Network Design

This page was built for publication: Approximation algorithms for a capacitated network design problem