Faster Approximation Algorithms for the Unit Capacity Concurrent Flow Problem with Applications to Routing and Finding Sparse Cuts.
Philip N. KleinSerge A. PlotkinClifford SteinÉva TardosPublished in: SIAM J. Comput. (1994)
Keyphrases
- approximation algorithms
- special case
- np hard
- worst case
- vertex cover
- primal dual
- minimum cost
- network design problem
- approximation ratio
- facility location problem
- approximation schemes
- open shop
- routing protocol
- set cover
- min cost
- constant factor
- np hardness
- combinatorial auctions
- shortest path
- randomized algorithms
- polynomial time approximation
- learning algorithm