✦ LIBER ✦

Improved approximation algorithms for the Min–Max Selecting Items problem

✍ Scribed by Doerr, Benjamin

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Approximating the min–max (regret) selec

✍ Kasperski, Adam; Kurpisz, Adam; Zieliński, Paweł 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 220 KB

A randomized algorithm for the min-max s

✍ Adam Kasperski; Paweł Zieliński 📂 Article 📅 2009 🏛 Springer US 🌐 English ⚖ 311 KB

Improved Approximation Algorithms for th

✍ M. Reza Khani, Mohammad R. Salavatipour 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 671 KB

An approximation algorithm for the gener

✍ Klaus Jansen 📂 Article 📅 2005 🏛 Springer-Verlag 🌐 English ⚖ 225 KB

Approximation schemes for the Min-Max St

✍ Leah Epstein; Tamir Tassa 📂 Article 📅 2004 🏛 Springer-Verlag 🌐 English ⚖ 193 KB

Exact and approximation algorithms for t

✍ Xu, Liang; Xu, Zhou; Xu, Dongsheng 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 565 KB