A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling.
Spencer ComptonPublished in: ISIT (2022)
Keyphrases
- greedy algorithm
- approximation guarantees
- linear programming relaxation
- lower bound
- greedy algorithms
- upper bound
- knapsack problem
- worst case
- integrality gap
- approximation ratio
- objective function
- dynamic programming
- linear programming
- search algorithm
- approximation algorithms
- cost function
- constant factor
- branch and bound
- np hard
- linear program
- integer programming
- column generation
- mixed integer programming
- bayesian networks