✦ LIBER ✦

NP-hard problems in hierarchical-tree clustering

✍ Scribed by Mirko Křivánek; Jaroslav Morávek

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Solving NP-hard problems in ‘almost tree

✍ Don Coppersmith; Uzi Vishkin 📂 Article 📅 1985 🏛 Elsevier Science 🌐 English ⚖ 842 KB

Labeled Search Trees and Amortized Analy

✍ Jianer Chen; Iyad A. Kanj; Ge Xia 📂 Article 📅 2005 🏛 Springer 🌐 English ⚖ 270 KB

Several NP-hard problems arising in robu

✍ A. Nemirovskii 📂 Article 📅 1993 🏛 Springer 🌐 English ⚖ 321 KB

Prediction problem in quantum mechanics

✍ Vladik Kreinovich; Alejandro Vazquez; Olga Kosheleva 📂 Article 📅 1991 🏛 Springer 🌐 English ⚖ 563 KB

A hybrid system for multiobjective probl

✍ M.R. Gholamian; S.M.T. Fatemi Ghomi; M. Ghazanfari 📂 Article 📅 2007 🏛 Elsevier Science 🌐 English ⚖ 889 KB

Hierarchical trees in N-body simulations

✍ F.D. Murtagh 📂 Article 📅 1988 🏛 Elsevier Science 🌐 English ⚖ 364 KB