✦ LIBER ✦

Improved Approximation Algorithms for the Min-max Tree Cover and Bounded Tree Cover Problems

✍ Scribed by M. Reza Khani, Mohammad R. Salavatipour

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Improved Approximations for Tour and Tre

✍ Jochen Könemann; Goran Konjevod; Ojas Parekh; Amitabh Sinha 📂 Article 📅 2003 🏛 Springer 🌐 English ⚖ 170 KB

Enumerate and Expand: Improved Algorithm

✍ Daniel Mölle; Stefan Richter; Peter Rossmanith 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 483 KB

Exact and approximation algorithms for t

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

Approximation of max independent set, mi

✍ Nicolas Bourgeois; Bruno Escoffier; Vangelis Th. Paschos 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 358 KB

Improved approximation algorithms for th

✍ Doerr, Benjamin 📂 Article 📅 2013 🏛 Elsevier Science 🌐 English ⚖ 175 KB

A randomized NC algorithm for the maxima

✍ Zhi-Zhong Chen 📂 Article 📅 1991 🏛 Elsevier Science 🌐 English ⚖ 769 KB