Brief Announcement: Approximation Algorithms for Unsplittable Resource Allocation Problems with Diseconomies of Scale.
Antje BjeldeMax KlimmDaniel SchmandPublished in: SPAA (2017)
Keyphrases
- approximation algorithms
- resource allocation problems
- resource allocation
- np hard
- special case
- vertex cover
- worst case
- resource constraints
- minimum cost
- network design problem
- exact algorithms
- set cover
- primal dual
- open shop
- np hardness
- approximation ratio
- facility location problem
- randomized algorithms
- genetic algorithm
- constant factor
- approximation schemes
- combinatorial auctions
- constant factor approximation