Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.
Paul W. GoldbergAlexandros HollenderWarut SuksompongPublished in: CoRR (2019)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- special case
- facility location problem
- vertex cover
- minimum cost
- computational complexity
- network design problem
- primal dual
- optimal solution
- constant factor
- exact algorithms
- randomized algorithms
- set cover
- np complete
- approximation schemes
- knapsack problem
- phase transition
- integer programming
- disjoint paths
- approximation ratio
- scheduling problem
- greedy heuristic
- upper bound
- lower bound
- approximation guarantees
- branch and bound