✦ LIBER ✦

Tight Results on Minimum Entropy Set Cover

✍ Scribed by Jean Cardinal; Samuel Fiorini; Gwenaël Joret

Publisher: Springer
Year: 2007
Tongue: English
Weight: 334 KB
Volume: 51
Category: Article
ISSN: 0178-4617
DOI: 10.1007/s00453-007-9076-8

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Tight bounds on the number of minimum-me

Tight bounds on the number of minimum-mean cycle cancellations and related results

✍ Tomasz Radzik; Andrew V. Goldberg 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 973 KB

On minimum sets of 1-factors covering a

On minimum sets of 1-factors covering a complete multipartite graph

✍ David Cariolaro; Hung-Lin Fu 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 132 KB 👁 1 views

## Abstract We determine necessary and sufficient conditions for a complete multipartite graph to admit a set of 1‐factors whose union is the whole graph and, when these conditions are satisfied, we determine the minimum size of such a set. © 2008 Wiley Periodicals, Inc. J Graph Theory 58:239‐250,

On the relationship of minimum and optim

On the relationship of minimum and optimum covers for a set of functional dependencies

✍ Heikki Mannila; Kari-Jouko Räihä 📂 Article 📅 1983 🏛 Springer-Verlag 🌐 English ⚖ 700 KB