Approximation Algorithms for Maximin Fair Division.
Siddharth BarmanSanath Kumar Krishna MurthyPublished in: CoRR (2017)
Keyphrases
- approximation algorithms
- np hard
- special case
- worst case
- vertex cover
- graph theory
- network design problem
- minimum cost
- upper bound
- facility location problem
- exact algorithms
- precedence constraints
- approximation schemes
- undirected graph
- set cover
- open shop
- np hardness
- approximation ratio
- disjoint paths
- randomized algorithms
- network flow
- knapsack problem