The clustering matroid and the optimal clustering tree
type: Item
instance of: scholarly article
title: The clustering matroid and the optimal clustering tree
zbMATH Open document ID: 1160.90638
author: D. Massart
published in: Mathematical Programming. Series A. Series B
publication date: 2004-03-11T00:00:00Z
Mathematics Subject Classification ID: 90C27
Mathematics Subject Classification ID: 05B05
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 52B40
Mathematics Subject Classification ID: 68Q25
Mathematics Subject Classification ID: 90C57
zbMATH DE Number: 2055196
zbMATH Keywords: combinatorial optimization
zbMATH Keywords: clustering spanning trees
zbMATH Keywords: matroids
zbMATH Keywords: hypergraphs
zbMATH Keywords: polynomial graph algorithms
zbMATH Keywords: primal-dual algorithms
zbMATH Keywords: polyhedra
MaRDI profile type: Publication
full work available at URL: s10107-003-0410-x
OpenAlex ID: W2050339304
DOI: 10.1007/S10107-003-0410-X
Recommended article: Optimal clustering of multipartite graphs
Recommended article: A polynomial-time algorithm for optimal clustering in a special class of {0, l} -matrices
Recommended article: On the Optimal Stars Clustering Tree Problem
Recommended article: Q3504608
Recommended article: Optimal hierarchical clustering on a graph
Recommended article: Graph Clustering and Minimum Cut Trees
Recommended article: The complete optimal stars-clustering-tree problem
Recommended article: Q5753787
Recommended article: ALMOST OPTIMAL SOLUTIONS TO k-CLUSTERING PROBLEMS
Recommended article: Q4247450
description: scientific article; zbMATH DE number 2055196