Capacitated network design on undirected graphs

DOI10.1007/978-3-642-40328-6_6MaRDI QIDQ2851849zbMATH OpenOpenAlexFDO

Authors Deeparnab Chakrabarty, Ravishankar Krishnaswamy, Shi Li, Srivatsan Narayanan

Publication date 4 October 2013

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-40328-6_6

Mathematics Subject Classification ID

Signed and weighted graphs (05C22) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Approximability of capacitated network design
• Approximability of capacitated network design
• Approximation algorithms for a capacitated network design problem
• scientific article; zbMATH DE number 1670539
• Minimum cost source location problems with flow requirements

Cited in

(9)

• A characterization of the uncapacitated network design polytope
• A robustness approach to uncapacitated network design problems
• Feasibility in capacitated networks: The effect of individual arcs and nodes
• Flexible graph connectivity
• Approximability of capacitated network design
• On fixed cost k-flow problems
• The minimum vulnerability problem
• Hallucination helps: energy efficient virtual circuit routing
• Algorithms – ESA 2005

This page was built for publication: Capacitated network design on undirected graphs

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2851849)