Approximation Algorithms for Multi-Dimensional Assignment Problems with Decomposable Costs.
Hans-Jürgen BandeltYves CramaFrits C. R. SpieksmaPublished in: Discret. Appl. Math. (1994)
Keyphrases
- undirected graph
- approximation algorithms
- multi dimensional
- np hard
- special case
- minimum cost
- vertex cover
- worst case
- facility location problem
- disjoint paths
- np complete
- network design problem
- primal dual
- set cover
- approximation ratio
- combinatorial auctions
- precedence constraints
- open shop
- randomized algorithms
- single item
- constant factor
- approximation schemes
- high dimensional