Dynamic programming and convex clustering

DOI10.1007/BF01182769zbMath0792.90085OpenAlexW2031642643MaRDI QIDQ1314428

Vladimir Batagelj, Sandi Klavžar, Simona Korenjak-Černe

Publication date: 16 February 1994

Published in: Algorithmica (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf01182769

zbMATH Keywords

\(k\)-clustering problemslinear ordered setssufficient conditions for convexity

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Abstract computational complexity for mathematical programming problems (90C60) Dynamic programming (90C39)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Clustering with relational constraint
• Optimal Set Partitioning
• On Grouping for Maximum Homogeneity
• A Dynamic Programming Algorithm for Cluster Analysis
• Cluster Analysis and Mathematical Programming

This page was built for publication: Dynamic programming and convex clustering