Approximation Algorithms for Maximin Fair Division.
Siddharth BarmanSanath Kumar KrishnamurthyPublished in: ACM Trans. Economics and Comput. (2020)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- minimum cost
- upper bound
- vertex cover
- graph theory
- open shop
- facility location problem
- set cover
- primal dual
- exact algorithms
- network design problem
- precedence constraints
- np hardness
- disjoint paths
- approximation ratio
- combinatorial auctions
- constant factor
- randomized algorithms
- undirected graph
- approximation schemes
- linear programming
- computational complexity
- genetic algorithm