Approximation Algorithms for Computing Maximin Share Allocations.
Georgios AmanatidisEvangelos MarkakisAfshin NikzadAmin SaberiPublished in: ACM Trans. Algorithms (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- minimum cost
- facility location problem
- network design problem
- primal dual
- precedence constraints
- approximation ratio
- upper bound
- np hardness
- set cover
- open shop
- disjoint paths
- undirected graph
- graph theory
- resource allocation
- randomized algorithms
- constant factor approximation
- combinatorial auctions
- constant factor
- approximation guarantees
- approximation schemes