On the Optimal Stars Clustering Tree Problem

DOI10.1016/J.ENDM.2006.08.074zbMATH Open1293.05046OpenAlexW1974468067MaRDI QIDQ3439552FDOQ3439552

Authors: Michal Stern, Ephraim Korach 

Publication date: 29 May 2007

Published in: Electronic Notes in Discrete Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.endm.2006.08.074

Recommendations

• The complete optimal stars-clustering-tree problem
• The clustering matroid and the optimal clustering tree
• An algorithmic framework for the exact solution of tree-star problems
• The tree-star problem: a formulation and a branch-and-cut algorithm
• Optimal hierarchical clustering on a graph
• Clustering in trees: Optimizing cluster sizes and number of subtrees
• Almost optimal solutions to \(k\)-clustering problems
• On variants of the spanning star forest problem
• On the clustered Steiner tree problem
• On the clustered Steiner tree problem

zbMATH Keywords

combinatorial optimizationhypergraphsstarsclustering spanning treespolynomial graph algorithms

Mathematics Subject Classification ID

Trees (05C05) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Combinatorial aspects of matroids and geometric lattices (05B35) Hypergraphs (05C65)

Cited In (3)

• The clustering matroid and the optimal clustering tree
• Clustering in trees: Optimizing cluster sizes and number of subtrees
• The complete optimal stars-clustering-tree problem

This page was built for publication: On the Optimal Stars Clustering Tree Problem

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