A Tighter Approximation Guarantee for Greedy Minimum Entropy Coupling.
Spencer ComptonPublished in: CoRR (2022)
Keyphrases
- greedy algorithm
- approximation guarantees
- linear programming relaxation
- lower bound
- upper bound
- greedy algorithms
- worst case
- integrality gap
- approximation ratio
- knapsack problem
- objective function
- dynamic programming
- linear programming
- approximation algorithms
- np hard
- polynomial time approximation
- model selection
- np complete
- theoretical analysis
- column generation