✦ LIBER ✦

Algorithms and complexity results for labeled correlation clustering problem

✍ Scribed by Liu, Xianmin; Li, Jianzhong

Book ID: 120694262
Publisher: Springer US
Year: 2013
Tongue: English
Weight: 545 KB
Volume: 29
Category: Article
ISSN: 1382-6905
DOI: 10.1007/s10878-013-9607-y

No coin nor oath required. For personal study only.

📜 SIMILAR VOLUMES

Expected-time complexity results for hie

Expected-time complexity results for hierarchic clustering algorithms which use cluster centres

✍ F. Murtagh 📂 Article 📅 1983 🏛 Elsevier Science 🌐 English ⚖ 406 KB

Algorithms and complexity results for pe

Algorithms and complexity results for persuasive argumentation

✍ Eun Jung Kim; Sebastian Ordyniak; Stefan Szeider 📂 Article 📅 2011 🏛 Elsevier Science 🌐 English ⚖ 299 KB

Improved Approximation Algorithms for Bi

Improved Approximation Algorithms for Bipartite Correlation Clustering

✍ Ailon, Nir; Avigdor-Elgrabli, Noa; Liberty, Edo; van Zuylen, Anke 📂 Article 📅 2012 🏛 Society for Industrial and Applied Mathematics 🌐 English ⚖ 242 KB

Complexity Results and Exact Algorithms

Complexity Results and Exact Algorithms for Robust Knapsack Problems

✍ TallaÂ Nobibon, Fabrice; Leus, Roel 📂 Article 📅 2013 🏛 Springer 🌐 English ⚖ 607 KB

A dynamic edge covering and scheduling p

A dynamic edge covering and scheduling problem: complexity results and approximation algorithms

✍ Jiaming Qiu, Thomas C. Sharkey 📂 Article 📅 2013 🏛 Springer-Verlag 🌐 English ⚖ 193 KB

Optimization models and algorithms for t

Optimization models and algorithms for the hyperplane clustering problem

✍ Kanika Dhyani 📂 Article 📅 2010 🏛 Springer 🌐 English ⚖ 93 KB