Login / Signup
On the approximability of some network design problems.
Julia Chuzhoy
Anupam Gupta
Joseph Naor
Amitabh Sinha
Published in:
SODA (2005)
Keyphrases
</>
network design problem
approximation algorithms
np hard
capacitated fixed charge
special case
network flow problem
minimum cost
worst case
primal dual
network design
branch and bound
mixed integer programming
lagrangian relaxation
search algorithm
mixed integer
optimal solution
transportation networks
lower bound