Greedy additive approximation algorithms for minimum-entropy coupling problem.
Massimiliano RossiPublished in: ISIT (2019)
Keyphrases
- approximation algorithms
- greedy algorithm
- np hard
- special case
- worst case
- facility location problem
- vertex cover
- minimum cost
- search algorithm
- primal dual
- set cover
- approximation ratio
- approximation schemes
- open shop
- constant factor approximation
- greedy algorithms
- network design problem
- np hardness
- greedy heuristic
- search space
- precedence constraints
- randomized algorithms
- undirected graph
- dynamic programming
- constant factor
- multistage