✦ LIBER ✦

A fast approximation algorithm for solving the complete set packing problem

✍ Scribed by Nguyen, Tri-Dung

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

A Fast Algorithm for the Path 2-Packing

✍ Maxim A. Babenko 📂 Article 📅 2008 🏛 Springer 🌐 English ⚖ 668 KB

A fast approximation algorithm for the m

✍ Nicholas G. Hall; Dorit S. Hochbaum 📂 Article 📅 1986 🏛 Elsevier Science 🌐 English ⚖ 255 KB

A randomised approximation algorithm for

✍ El Ouali, Mourad; Fohlin, Helena; Srivastav, Anand 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 635 KB

A Fast Approximation Algorithm for the S

✍ Bartosz Przydatek 📂 Article 📅 2002 🏛 John Wiley and Sons 🌐 English ⚖ 746 KB

A pure quasi-human algorithm for solving

✍ WenQi Huang; Kun He 📂 Article 📅 2009 🏛 Science in China Press (SCP) 🌐 English ⚖ 439 KB

Approximation Algorithm for the Mixed Fr

✍ Jansen, Klaus 📂 Article 📅 2006 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 253 KB