𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Approximation algorithms for the test cover problem

✍ Scribed by K.M.J. De Bontridder; B.V. Halldórsson; M.M. Halldórsson; C.A.J. Hurkens; J.K. Lenstra; R. Ravi; L. Stougie

Publisher
Springer-Verlag
Year
2003
Tongue
English
Weight
190 KB
Volume
98
Category
Article
ISSN
0025-5610

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Computational experience with approximat
Computational experience with approximation algorithms for the set covering problem
✍ Tal Grossman; Avishai Wool 📂 Article 📅 1997 🏛 Elsevier Science 🌐 English ⚖ 722 KB

The Set Covering problem (SCP) is a well known combinatorial optimization problem, which is NP-hard. We conducted a comparative study of nine different approximation algorithms for the SCP, including several greedy variants, fractional relaxations, randomized algorithms and a neural network algorith