✦ LIBER ✦

Intersection Inequalities for the Covering Problem

✍ Scribed by Stanton, R. G.; Kalbfleisch, J. G.

Book ID: 118191717
Publisher: Society for Industrial and Applied Mathematics
Year: 1969
Tongue: English
Weight: 634 KB
Volume: 17
Category: Article
ISSN: 0036-1399
DOI: 10.1137/0117123

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Linear inequalities for covering codes.

Linear inequalities for covering codes. I. Pair covering inequalities

✍ Zhang, Z. 📂 Article 📅 1991 🏛 IEEE 🌐 English ⚖ 833 KB

The intersection problem for

✍ Selda Küçükçifçi 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 133 KB

On separating cover inequalities for the

On separating cover inequalities for the multidimensional knapsack problem

✍ Tolga Bektas; Osman Oğuz 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 160 KB

Row family inequalities for the set cove

Row family inequalities for the set covering polyhedron

✍ Gabriela R. Argiroffo; Silvia M. Bianchi 📂 Article 📅 2010 🏛 Elsevier Science 🌐 English ⚖ 206 KB

Stability and slicing inequalities for i

Stability and slicing inequalities for intersection bodies

✍ Koldobsky, Alexander; Ma, Dan 📂 Article 📅 2012 🏛 Springer 🌐 English ⚖ 178 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