✦ LIBER ✦

Problems and algorithms for covering arrays

✍ Scribed by Alan Hartman; Leonid Raskin

Book ID: 108113400
Publisher: Elsevier Science
Year: 2004
Tongue: English
Weight: 201 KB
Volume: 284
Category: Article
ISSN: 0012-365X
DOI: 10.1016/j.disc.2003.11.029

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Explicit and implicit algorithms for bin

Explicit and implicit algorithms for binate covering problems

✍ Villa, T.; Kam, T.; Brayton, R.K.; Sangiovanni-Vincenteili, A.L. 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 417 KB

Locating Errors Using ELAs, Covering Arr

Locating Errors Using ELAs, Covering Arrays, and Adaptive Testing Algorithms

✍ Martínez, Conrado; Moura, Lucia; Panario, Daniel; Stevens, Brett 📂 Article 📅 2010 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 431 KB

Approximation Algorithms for the Set Cov

Approximation Algorithms for the Set Covering and Vertex Cover Problems

✍ Hochbaum, Dorit S. 📂 Article 📅 1982 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 259 KB

On-Line and Off-Line Approximation Algor

On-Line and Off-Line Approximation Algorithms for Vector Covering Problems

✍ Alon, N.; Azar, Y.; Csirik, J.; Epstein, L.; Sevastianov, S. V.; Vestjens, A. P. 📂 Article 📅 1998 🏛 Springer 🌐 English ⚖ 151 KB

Algorithms for the Set Covering Problem

✍ Alberto Caprara; Paolo Toth; Matteo Fischetti 📂 Article 📅 2000 🏛 Springer US 🌐 English ⚖ 101 KB

An algorithm for set covering problem

✍ J.E. Beasley 📂 Article 📅 1987 🏛 Elsevier Science 🌐 English ⚖ 763 KB