Tight Lower Bounds on Envy-Free Makespan Approximation.
Amos FiatAriel LevaviPublished in: WINE (2012)
Keyphrases
- lower bound
- upper bound
- np hard
- worst case
- branch and bound algorithm
- branch and bound
- objective function
- approximation algorithms
- envy free
- optimal solution
- linear programming relaxation
- integrality gap
- scheduling problem
- min sum
- error bounds
- upper and lower bounds
- polynomial approximation
- np complete
- pareto optimal
- resource allocation
- linear programming