Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.
Paul W. GoldbergAlexandros HollenderWarut SuksompongPublished in: AAAI (2020)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- vertex cover
- set cover
- facility location problem
- network design problem
- computational complexity
- minimum cost
- np complete
- integer programming
- scheduling problem
- optimal solution
- phase transition
- primal dual
- constant factor
- exact algorithms
- approximation schemes
- linear programming
- lower bound
- approximation ratio
- greedy algorithm
- randomized algorithms
- open shop
- greedy heuristic
- network flow
- undirected graph
- error bounds
- linear program
- search algorithm