Approximation Algorithms for Multi-index Transportation Problems with Decomposable Costs.
Maurice QueyranneFrits C. R. SpieksmaPublished in: Discret. Appl. Math. (1997)
Keyphrases
- approximation algorithms
- transportation problem
- np hard
- special case
- minimum cost
- worst case
- vertex cover
- facility location problem
- set cover
- integer programming
- primal dual
- np hardness
- open shop
- approximation schemes
- constant factor
- disjoint paths
- approximation ratio
- network design problem
- precedence constraints
- randomized algorithms
- polynomial time approximation
- subsequence matching
- approximation guarantees
- branch and bound algorithm
- undirected graph
- constant factor approximation