✦ LIBER ✦

The p-cover problem

✍ Scribed by Zvi Drezner

Book ID: 103793598
Publisher: Elsevier Science
Year: 1986
Tongue: English
Weight: 172 KB
Volume: 26
Category: Article
ISSN: 0377-2217
DOI: 10.1016/0377-2217(86)90196-7

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

The p maximal cover - p partial center p

The p maximal cover - p partial center problem on networks

✍ Oded Berman 📂 Article 📅 1994 🏛 Elsevier Science 🌐 English ⚖ 642 KB

The Ferry Cover Problem

✍ Michael Lampis; Valia Mitsou 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 312 KB

Covering Graphs: The Covering Problem So

Covering Graphs: The Covering Problem Solved

✍ Yair Caro; Raphael Yuster 📂 Article 📅 1998 🏛 Elsevier Science 🌐 English ⚖ 238 KB

For every fixed graph H, we determine the H-covering number of K n , for all n>n 0 (H ). We prove that if h is the number of edges of H, and gcd(H )=d is the greatest common divisor of the degrees of H, then there exists n 0 =n 0 (H ), such that for all n>n 0 , Our main tool in proving this result

Uncapacitated single allocation p-hub ma

Uncapacitated single allocation p-hub maximal covering problem

✍ Young Ha Hwang; Young Hoon Lee 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 466 KB

The Minimum Substring Cover problem

✍ Danny Hermelin; Dror Rawitz; Romeo Rizzi; Stéphane Vialette 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 239 KB

The Online Set Cover Problem

✍ Alon, Noga; Awerbuch, Baruch; Azar, Yossi; Buchbinder, Niv; Naor, Joseph (Seffi) 📂 Article 📅 2009 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 193 KB