Approximation algorithms and hardness of integral concurrent flow.
Parinya ChalermsookJulia ChuzhoyAlina EneShi LiPublished in: STOC (2012)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- min cost
- vertex cover
- minimum cost
- facility location problem
- np complete
- network design problem
- primal dual
- approximation ratio
- open shop
- computational complexity
- undirected graph
- linear programming
- phase transition
- constant factor
- randomized algorithms
- exact algorithms
- scheduling problem
- branch and bound algorithm
- precedence constraints
- linear program
- integer programming
- approximation schemes
- combinatorial auctions
- upper bound
- lower bound
- error bounds
- information theoretic
- constraint satisfaction problems