Capacitated Network Design on Undirected Graphs
From MaRDI portal
Publication:2851849
DOI10.1007/978-3-642-40328-6_6zbMath1405.68439OpenAlexW171788235MaRDI QIDQ2851849
Ravishankar Krishnaswamy, Shi Li, Srivatsan Narayanan, Deeparnab Chakrabarty
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
Programming involving graphs or networks (90C35) Approximation algorithms (68W25) Signed and weighted graphs (05C22)
Related Items (5)
The minimum vulnerability problem ⋮ Hallucination Helps: Energy Efficient Virtual Circuit Routing ⋮ Approximability of capacitated network design ⋮ On fixed cost \(k\)-flow problems ⋮ Flexible graph connectivity
This page was built for publication: Capacitated Network Design on Undirected Graphs