Approximation Algorithms for Maximin Fair Division.
Siddharth BarmanSanath Kumar Krishna MurthyPublished in: EC (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- graph theory
- minimum cost
- upper bound
- approximation schemes
- set cover
- primal dual
- exact algorithms
- facility location problem
- approximation ratio
- network design problem
- randomized algorithms
- np hardness
- open shop
- precedence constraints
- polynomial time approximation
- constant factor approximation
- learning algorithm
- combinatorial auctions
- disjoint paths