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