Contiguous Cake Cutting: Hardness Results and Approximation Algorithms.
Paul GoldbergAlexandros HollenderWarut SuksompongPublished in: J. Artif. Intell. Res. (2020)
Keyphrases
- approximation algorithms
- np hard
- np hardness
- worst case
- vertex cover
- special case
- np complete
- minimum cost
- computational complexity
- network design problem
- facility location problem
- set cover
- approximation ratio
- undirected graph
- randomized algorithms
- integer programming
- primal dual
- exact algorithms
- constant factor
- scheduling problem
- branch and bound algorithm
- open shop
- precedence constraints
- optimal solution
- information theoretic
- constant factor approximation
- lower bound
- phase transition
- knapsack problem
- error bounds
- greedy heuristic
- network flow
- combinatorial auctions
- approximation guarantees
- linear programming
- approximation schemes
- single machine