✦ LIBER ✦

The complexity of multicut and mixed multicut problems in (di)graphs

✍ Scribed by Bang-Jensen, Jørgen; Yeo, Anders

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the complexity of the multicut proble

✍ Cédric Bentz 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 232 KB

Exact and approximate resolution of inte

✍ Cédric Bentz 📂 Article 📅 2007 🏛 Springer 🌐 English ⚖ 91 KB

Improved algorithms for the multicut and

✍ A. Tamir 📂 Article 📅 2007 🏛 Springer-Verlag 🌐 English ⚖ 293 KB

On the hardness of finding near-optimal

✍ Cédric Bentz 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 255 KB

The complexity of domination problems in

✍ J.Mark Keil 📂 Article 📅 1993 🏛 Elsevier Science 🌐 English ⚖ 854 KB

The algorithmic complexity of bondage an

✍ Hu, Fu-Tao; Sohn, Moo Young 📂 Article 📅 2014 🏛 Elsevier Science 🌐 English ⚖ 301 KB