Approximation Algorithms for Computing Maximin Share Allocations.
Georgios AmanatidisEvangelos MarkakisAfshin NikzadAmin SaberiPublished in: ICALP (1) (2015)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- facility location problem
- minimum cost
- vertex cover
- approximation ratio
- primal dual
- network design problem
- set cover
- upper bound
- constant factor
- open shop
- exact algorithms
- graph theory
- undirected graph
- np hardness
- constant factor approximation
- partial order
- genetic algorithm
- resource allocation
- theoretical analysis
- approximation schemes
- disjoint paths