Global routing by new approximation algorithms for multicommodityflow.
Christoph AlbrechtPublished in: IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. (2001)
Keyphrases
- approximation algorithms
- np hard
- special case
- minimum cost
- vertex cover
- facility location problem
- exact algorithms
- worst case
- primal dual
- randomized algorithms
- approximation ratio
- approximation schemes
- constant factor
- open shop
- np hardness
- set cover
- disjoint paths
- undirected graph
- combinatorial auctions
- upper bound
- routing protocol
- network design problem
- scheduling problem
- shortest path