Tight Results on Minimum Entropy Set Cover

DOI10.1007/11830924_8MaRDI QIDQ3595399zbMATH OpenOpenAlexFDO

Authors Jean Cardinal, Samuel Fiorini, Gwenaël Joret

Publication date 28 August 2007

Published in Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/11830924_8

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Approximation algorithms (68W25)

Recommendations

• Tight results on minimum entropy set cover
• The minimum-entropy set cover problem
• Automata, Languages and Programming
• Improved approximation algorithms for low-density instances of the minimum entropy set cover problem
• The minimum entropy submodular set cover problem

Cited in

(11)

• Minimum entropy coloring
• Entropy and set covering
• 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
• Minimum entropy combinatorial optimization problems
• A Stab at Approximating Minimum Subadditive Join
• Automata, Languages and Programming
• Algorithms and Computation
• Minimum entropy combinatorial optimization problems
• Tight results on minimum entropy set cover

This page was built for publication: Tight Results on Minimum Entropy Set Cover

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3595399)