✦ LIBER ✦

Oblivious Algorithms for the Maximum Directed Cut Problem

✍ Scribed by Feige, Uriel; Jozeph, Shlomo

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

New algorithms for the weighted maximum

✍ N. Z. Shor; O. A. Berezovskii 📂 Article 📅 1995 🏛 Springer US 🌐 English ⚖ 360 KB

A new scaling algorithm for the maximum

✍ Kazuo Iwano; Shinji Misono; Shu Tezuka; Satoru Fujishige 📂 Article 📅 1994 🏛 Springer 🌐 English ⚖ 673 KB

Spectral bounds for the maximum cut prob

✍ Walid Ben-Ameur; José Neto 📂 Article 📅 2008 🏛 John Wiley and Sons 🌐 English ⚖ 107 KB

A 2-Approximation Algorithm for the Dire

✍ Naor, Joseph (Seffi); Zosin, Leonid 📂 Article 📅 2001 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 113 KB

Cache Oblivious Algorithms for the RMQ a

✍ Masud Hasan; Tanaeem M. Moosa; M. Sohel Rahman 📂 Article 📅 2010 🏛 Springer-Verlag 🌐 English ⚖ 202 KB

A branch-and-cut algorithm for the maxim

✍ CorberÃ¡n, Ãngel; Plana, Isaac; RodrÃguez-ChÃa, Antonio M.; Sanchis, JosÃ© M. 📂 Article 📅 2011 🏛 Springer-Verlag 🌐 English ⚖ 467 KB