✦ LIBER ✦

Combinatorial model and bounds for target set selection

✍ Scribed by Eyal Ackerman; Oren Ben-Zwi; Guy Wolfovitz

Book ID: 113927373
Publisher: Elsevier Science
Year: 2010
Tongue: English
Weight: 219 KB
Volume: 411
Category: Article
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.08.021

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Bound sets for biobjective combinatorial

Bound sets for biobjective combinatorial optimization problems

✍ Matthias Ehrgott; Xavier Gandibleux 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 513 KB

Risk bounds for model selection via pena

Risk bounds for model selection via penalization

✍ Andrew Barron; Lucien Birgé; Pascal Massart 📂 Article 📅 1999 🏛 Springer 🌐 English ⚖ 650 KB

Bounds for Selection

✍ Hyafil, Laurent 📂 Article 📅 1976 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 527 KB

Planar Feedback Vertex Set and Face Cove

Planar Feedback Vertex Set and Face Cover: Combinatorial Bounds and Subexponential Algorithms

✍ Athanassios Koutsonas; Dimitrios M. Thilikos 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 755 KB

A unified setting for sequencing, rankin

A unified setting for sequencing, ranking, and selection algorithms for combinatorial objects

✍ Herbert S Wilf 📂 Article 📅 1977 🏛 Elsevier Science 🌐 English ⚖ 486 KB

A lower bound for the hitting set size f

A lower bound for the hitting set size for combinatorial rectangles and an application

✍ L.Sunil Chandran 📂 Article 📅 2003 🏛 Elsevier Science 🌐 English ⚖ 87 KB

We prove a lower bound of ( 1 ε (m + log(da)) where a = log m ( 1 4ε ) for the hitting set size for combinatorial rectangles of volume at least ε in 9 ] and d > 2.