✦ LIBER ✦

Solving hard set covering problems

✍ Scribed by Carlo Mannino; Antonio Sassano

Publisher: Elsevier Science
Year: 1995
Tongue: English
Weight: 357 KB
Volume: 18
Category: Article
ISSN: 0167-6377
DOI: 10.1016/0167-6377(95)00034-h

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving a fuzzy set-covering problem

✍ M.J. Hwang; C.I. Chiang; Y.H. Liu 📂 Article 📅 2004 🏛 Elsevier Science 🌐 English ⚖ 249 KB

Solving large set covering problems on a

Solving large set covering problems on a personal computer

✍ Francis J. Vasko; Floyd E. Wolf 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 583 KB

Solving the set cover problem on a super

Solving the set cover problem on a supercomputer

✍ S.J Shyu; R.C.T Lee 📂 Article 📅 1990 🏛 Elsevier Science 🌐 English ⚖ 454 KB

Probabilistic partial set covering probl

Probabilistic partial set covering problems

✍ Hanif D. Sherali; Seong-In Kim; Edna L. Parrish 📂 Article 📅 1991 🏛 John Wiley and Sons 🌐 English ⚖ 563 KB

Solving large Steiner Triple Covering Pr

Solving large Steiner Triple Covering Problems

✍ James Ostrowski; Jeff Linderoth; Fabrizio Rossi; Stefano Smriglio 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 316 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