✦ LIBER ✦

Efficient algorithms for the conditional covering problem

✍ Scribed by Robert Benkoczi; Binay Bhattacharya; Yuzhuang Hu; Chien-Hsin Lin; Qiaosheng Shi; Biing-Feng Wang

Book ID: 119257782
Publisher: Elsevier Science
Year: 2012
Tongue: English
Weight: 570 KB
Volume: 219
Category: Article
ISSN: 0890-5401
DOI: 10.1016/j.ic.2012.08.003

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Algorithms for solving the conditional c

Algorithms for solving the conditional covering problem on paths

✍ Brian J. Lunday; J. Cole Smith; Jeffrey B. Goldberg 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 111 KB

Efficient heuristic algorithms for the w

Efficient heuristic algorithms for the weighted set covering problem

✍ Edward K. Baker 📂 Article 📅 1981 🏛 Elsevier Science 🌐 English ⚖ 745 KB

Algorithms for the Set Covering Problem

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

Dynamic programming algorithms for the c

Dynamic programming algorithms for the conditional covering problem on path and extended star graphs

✍ Jennifer A. Horne; J. Cole Smith 📂 Article 📅 2005 🏛 John Wiley and Sons 🌐 English ⚖ 144 KB 👁 1 views

An efficient simulated annealing algorit

An efficient simulated annealing algorithm for the minimum vertex cover problem

✍ Xinshun Xu; Jun Ma 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 129 KB

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