✦ LIBER ✦

A parameterized algorithm for the hyperplane-cover problem

✍ Scribed by Jianxin Wang; Wenjun Li; Jianer Chen

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Parameterized reductions and algorithms

✍ Peter Damaschke; Leonid Molokov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 224 KB

A hyperplane-based algorithm for the dig

✍ Hansen, L.K.; Guanghan Xu 📂 Article 📅 1997 🏛 IEEE 🌐 English ⚖ 643 KB

Optimization models and algorithms for t

✍ Kanika Dhyani 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 93 KB

The set of parameterized -covers problem

✍ A.A. Gorbenko; V.Yu. Popov 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 221 KB

Algorithms for the Set Covering Problem

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

A genetic algorithm for the set covering

✍ J.E Beasley; P.C Chu 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 939 KB