A New Lower Bound for Deterministic Truthful Scheduling.
Yiannis GiannakopoulosAlexander HammerlDiogo PoçasPublished in: CoRR (2020)
Keyphrases
- lower bound
- randomized algorithms
- upper bound
- branch and bound
- np hard
- scheduling problem
- branch and bound algorithm
- randomized algorithm
- objective function
- worst case
- scheduling algorithm
- flexible manufacturing systems
- lower and upper bounds
- round robin
- optimal solution
- black box
- lower bounding
- mechanism design
- linear programming relaxation
- approximation guarantees
- resource constraints
- dynamic scheduling
- parallel machines
- approximation algorithms
- lagrangian relaxation
- database systems
- constant factor
- greedy algorithm
- search algorithm
- data structure
- polynomial approximation
- sufficiently accurate