Dynamic programming and convex clustering

descriptionPublicationkeyboard_double_arrow_right Article 01 Feb 1994 English Publisher:Springer Science and Business Media LLCJournal:Algorithmica, volume 11, pages 93-103 (issn: 0178-4617, eissn: 1432-0541,

Copyright policy )

Authors: Vladimir Batagelj; Simona Korenjak-Cerne; Sandi Klavzar;

doi: 10.1007/bf01182769

Dynamic programming and convex clustering

- Summary
- Subjects
- Metrics

Abstract

A dynamic programming procedure is developed for \(k\)-clustering problems for linear ordered sets. If the problem has an optimal solution which is convex (which implies that the cluster sets are intervals) then the dynamic programming approach gives an \(O(kn^ 3)\)-algorithm where \(n\) is the number of items. Sufficient conditions for convexity are derived.

Related Organizations

University of Ljubljana
Slovenia
University of Maribor
Slovenia

Keywords

sufficient conditions for convexity, Analysis of algorithms and problem complexity, linear ordered sets, Dynamic programming, Abstract computational complexity for mathematical programming problems, \(k\)-clustering problems

Impact byBIP!

	selected citations These citations are derived from selected sources. This is an alternative to the "Influence" indicator, which also reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	6
	popularity This indicator reflects the "current" impact/attention (the "hype") of an article in the research community at large, based on the underlying citation network.	Average
	influence This indicator reflects the overall/total impact of an article in the research community at large, based on the underlying citation network (diachronically).	Top 10%
	impulse This indicator reflects the initial momentum of an article directly after its publication, based on the underlying citation network.	Average