The minimum entropy submodular set cover problem

DOI10.1007/978-3-319-30000-9_23MaRDI QIDQ2798728zbMATH OpenOpenAlexFDO

Authors Cosmin Bonchiş, Liviu P. Dinu, Gabriel Istrate

Publication date 13 April 2016

Published in Language and Automata Theory and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-30000-9_23

zbMATH Keywords

approximation algorithmsminimum entropysubmodular set cover

Mathematics Subject Classification ID

Approximation algorithms (68W25) Combinatorial optimization (90C27) Cooperative games (91A12)

Recommendations

• Tight Results on Minimum Entropy Set Cover
• Tight results on minimum entropy set cover
• The minimum-entropy set cover problem
• Automata, Languages and Programming
• Minimum non-submodular cover problem with applications

Cited in

(12)

• Improved approximation algorithms for low-density instances of the minimum entropy set cover problem
• The minimum-entropy set cover problem
• A parametric worst-case approach to fairness in cooperative games with transferable utility
• Heapability, interactive particle systems, partial orders: results and open problems
• Minimum entropy combinatorial optimization problems
• Tight Results on Minimum Entropy Set Cover
• A Stab at Approximating Minimum Subadditive Join
• On minimum submodular cover with submodular cost
• Automata, Languages and Programming
• On the minimum consistent subset problem
• Minimum entropy combinatorial optimization problems
• Tight results on minimum entropy set cover

This page was built for publication: The minimum entropy submodular set cover problem

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