✦ LIBER ✦

Approximation of the Quadratic Set Covering problem

✍ Scribed by Bruno Escoffier; Peter L. Hammer

Book ID: 108114370
Publisher: Elsevier Science
Year: 2007
Tongue: English
Weight: 241 KB
Volume: 4
Category: Article
ISSN: 1572-5286
DOI: 10.1016/j.disopt.2007.10.001

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

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

Complexity and approximation of the conn

Complexity and approximation of the connected set-cover problem

✍ Wei Zhang, Weili Wu, Wonjun Lee, Ding-Zhu Du 📂 Article 📅 2011 🏛 Springer US 🌐 English ⚖ 246 KB

Approximating Node Connectivity Problems

Approximating Node Connectivity Problems via Set Covers

✍ Guy Kortsarz; Zeev Nutov 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 243 KB

Algorithms for the Set Covering Problem

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

Applications of the Location Set-coverin

Applications of the Location Set-covering Problem

✍ Charles ReVelle; Constantine Toregas; Louis Falkson 📂 Article 📅 2010 🏛 John Wiley and Sons 🌐 English ⚖ 545 KB