✦ LIBER ✦

On the hardness of finding near-optimal multicuts in directed acyclic graphs

✍ Scribed by Cédric Bentz

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

On the hardness of optimization in power

✍ Alessandro Ferrante; Gopal Pandurangan; Kihong Park 📂 Article 📅 2008 🏛 Elsevier Science 🌐 English ⚖ 266 KB

Algorithms to find the maximum set of pa

✍ Yu. V. Voitishin 📂 Article 📅 1992 🏛 Springer US 🌐 English ⚖ 415 KB

On the Maximal Number of Strongly Indepe

✍ Barak, Amnon B.; Erdös, Paul 📂 Article 📅 1984 🏛 Society for Industrial and Applied Mathematics ⚖ 589 KB

On the Steenrod length of real projectiv

✍ Ravi Vakil 📂 Article 📅 1999 🏛 Elsevier Science 🌐 English ⚖ 474 KB