The minimum-entropy set cover problem
From MaRDI portal
Combinatorial aspects of packing and covering (05B40) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Analysis of algorithms and problem complexity (68Q25) Learning and adaptive systems in artificial intelligence (68T05) Measures of information, entropy (94A17)
Recommendations
Cited in
(12)- Minimum entropy coloring
- The minimum likely column cover problem
- Entropy and set covering
- Matrix formulation of EISs of graphs and its application to WSN covering problems
- Improved approximation algorithms for low-density instances of the minimum entropy set cover problem
- The minimum-entropy set cover problem
- The minimum entropy submodular set cover problem
- Tight Results on Minimum Entropy Set Cover
- A Stab at Approximating Minimum Subadditive Join
- scientific article; zbMATH DE number 2111622 (Why is no real title available?)
- Approximation algorithms for a genetic diagnostics problem
- Tight results on minimum entropy set cover
This page was built for publication: The minimum-entropy set cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5466509)