Splitting an ordering into a partition to minimize diameter

DOI10.1007/S003579900003MaRDI QIDQ1367012zbMATH OpenOpenAlexFDO

Authors Charles J. Alpert, Andrew B. Kahng

Publication date 23 September 1998

Published in Journal of Classification (Search for Journal in Brave)

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

zbMATH Keywords

constrained clusteringdiameter criterionmaximum cluster diametermetric data setsoptimal bipartitionsrestricted partitionsequencingseriationvertex ordering

Mathematics Subject Classification ID

Dynamic programming (90C39) Applications of mathematical programming (90C90) Clustering in the social and behavioral sciences (91C20) Software, source code, etc. for problems pertaining to biology (92-04) Computational methods for problems pertaining to biology (92-08)

Recommendations

• The weighted sum of split and diameter clustering
• Minimum sum of diameters clustering
• Efficient algorithms for divisive hierarchical clustering with the diameter criterion
• Model selection for minimum-diameter partitioning

Cited in

(6)

• The weighted sum of split and diameter clustering
• Maximizing the ratio of cluster split to cluster diameter without and with cardinality constraints
• A sampling-based exact algorithm for the solution of the minimax diameter clustering problem
• Mathematical modeling and efficient optimization methods for the distance-dependent rearrangement clustering problem
• Partitioning a weighted partial order
• A network flow model for biclustering via optimal re-ordering of data matrices

This page was built for publication: Splitting an ordering into a partition to minimize diameter

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1367012)