Improved approximation algorithms for low-density instances of the Minimum Entropy Set Cover Problem
Cosmin BonchisGabriel IstratePublished in: CoRR (2012)
Keyphrases
- set cover
- approximation algorithms
- low density
- np hard
- greedy heuristics
- special case
- high density
- vertex cover
- worst case
- greedy algorithm
- minimum cost
- exact algorithms
- network flow
- approximation ratio
- randomized algorithms
- np complete
- primal dual
- convex hull
- reinforcement learning
- closest string
- open shop
- search algorithm
- solution space
- approximation guarantees
- computational complexity
- learning algorithm
- disjoint paths
- integrality gap
- branch and bound algorithm