✦ LIBER ✦

Optimal algorithms for the single and multiple vertex updating problems of a minimum spanning tree

✍ Scribed by D. B. Johnson and P. Metaxas

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Optimal Algorithms for the Single and Mu

✍ Metaxas, D.B. Johnson, P. 📂 Article 📅 1996 🏛 Springer 🌐 English ⚖ 192 KB

A global optimization algorithm for solv

✍ Oleksii Ursulenko, Sergiy Butenko, Oleg A. Prokopyev 📂 Article 📅 2012 🏛 Springer US 🌐 English ⚖ 300 KB

Np-hardness proof and an approximation a

✍ Keizo Miyata; Shigeru Masuyama; Shin-ichi Nakayama; Liang Zhao 📂 Article 📅 2006 🏛 Elsevier Science 🌐 English ⚖ 309 KB

A branch and bound algorithm for the cap

✍ Kavindra Malik; Gang Yu 📂 Article 📅 1993 🏛 John Wiley and Sons 🌐 English ⚖ 630 KB

A hybrid algorithm based on tabu search

✍ Hideki Katagiri; Tomohiro Hayashida; Ichiro Nishizaki; Qingqiang Guo 📂 Article 📅 2012 🏛 Elsevier Science 🌐 English ⚖ 536 KB

[Lecture Notes in Computer Science] Comp

✍ Moreno-Díaz, Roberto; Pichler, Franz; Quesada-Arencibia, Alexis 📂 Article 📅 2012 🏛 Springer Berlin Heidelberg ⚖ 176 KB