The Minimum Entropy Submodular Set Cover Problem

DOI10.1007/978-3-319-30000-9_23zbMath1443.68217OpenAlexW2294550488MaRDI QIDQ2798728

Liviu P. Dinu, Cosmin Bonchiş, Gabriel I. 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

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

Related Items (2)

A parametric worst-case approach to fairness in cooperative games with transferable utility ⋮ Heapability, Interactive Particle Systems, Partial Orders: Results and Open Problems

This page was built for publication: The Minimum Entropy Submodular Set Cover Problem