✦ LIBER ✦

Maximum algebraic connectivity augmentation is NP-hard

✍ Scribed by Damon Mosk-Aoyama

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Two-Dimensional Maximum-Likelihood Seque

✍ Ordentlich, E.; Roth, R.M. 📂 Article 📅 2011 🏛 IEEE 🌐 English ⚖ 274 KB

Maximum-likelihood decoding of Reed-Solo

✍ Guruswami, V.; Vardy, A. 📂 Article 📅 2005 🏛 IEEE 🌐 English ⚖ 276 KB

Finding a maximum compatible tree is NP-

✍ A.M. Hamel; M.A. Steel 📂 Article 📅 1996 🏛 Elsevier Science 🌐 English ⚖ 316 KB

Approximate belief updating in max-2-con

✍ Erez Karpas; Solomon Eyal Shimony; Amos Beimel 📂 Article 📅 2009 🏛 Elsevier Science 🌐 English ⚖ 139 KB

Finding the maximum a posteriori probabi

✍ Fischbacher, Urs 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 509 KB

The Single Machine Batching Problem with

✍ T.C.E. Cheng; C.T. Ng; J.J. Yuan 📂 Article 📅 2003 🏛 Springer US 🌐 English ⚖ 83 KB