The clustering matroid and the optimal clustering tree
DOI10.1007/s10107-003-0410-xzbMath1160.90638OpenAlexW2050339304MaRDI QIDQ1424305
Publication date: 11 March 2004
Published in: Mathematical Programming. Series A. Series B (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10107-003-0410-x
polyhedracombinatorial optimizationhypergraphsmatroidsprimal-dual algorithmsclustering spanning treespolynomial graph algorithms
Analysis of algorithms and problem complexity (68Q25) Matroids in convex geometry (realizations in the context of convex polytopes, convexity in combinatorial structures, etc.) (52B40) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial aspects of block designs (05B05) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (16)
This page was built for publication: The clustering matroid and the optimal clustering tree