Minimum-Entropy Coupling Approximation Guarantees Beyond the Majorization Barrier.
Spencer ComptonDmitriy KatzBenjamin QiKristjan H. GreenewaldMurat KocaogluPublished in: CoRR (2023)
Keyphrases
- np complete
- approximation guarantees
- np hard
- approximation algorithms
- greedy algorithm
- lower bound
- approximation ratio
- special case
- scheduling problem
- objective function
- worst case
- constant factor
- machine learning
- linear programming relaxation
- knapsack problem
- multistage
- machine learning algorithms
- theoretical analysis
- small number
- semi supervised
- cost function