✦ LIBER ✦

Solving the set cover problem on a supercomputer

✍ Scribed by S.J Shyu; R.C.T Lee

Publisher: Elsevier Science
Year: 1990
Tongue: English
Weight: 454 KB
Volume: 13
Category: Article
ISSN: 0167-8191
DOI: 10.1016/0167-8191(90)90132-s

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 hard set covering problems

✍ Carlo Mannino; Antonio Sassano 📂 Article 📅 1995 🏛 Elsevier Science 🌐 English ⚖ 357 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

Algorithms for solving numerical linear

Algorithms for solving numerical linear algebra problems on supercomputers

✍ T.J. Dekker; W. Hoffmann; P.P.M. De Rijk 📂 Article 📅 1989 🏛 Elsevier Science 🌐 English ⚖ 764 KB

Multigrid algorithms for solving structu

Multigrid algorithms for solving structural mechanics problems on supercomputers

✍ T. Hwang; S. Kacou; I.D. Parsons 📂 Article 📅 1991 🏛 Elsevier Science ⚖ 576 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