The clustering matroid and the optimal clustering tree

DOI10.1007/s10107-003-0410-xzbMath1160.90638OpenAlexW2050339304MaRDI QIDQ1424305

D. Massart

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

zbMATH Keywords

polyhedracombinatorial optimizationhypergraphsmatroidsprimal-dual algorithmsclustering spanning treespolynomial graph algorithms

Mathematics Subject Classification ID

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)

Approximation Algorithms for Not Necessarily Disjoint Clustered TSP ⋮ Vertices removal for feasibility of clustered spanning trees ⋮ On the approximability and hardness of minimum topic connected overlay and its special instances ⋮ Twins in Subdivision Drawings of Hypergraphs ⋮ Online and Approximate Network Construction from Bounded Connectivity Constraints ⋮ Online and approximate network construction from bounded connectivity constraints ⋮ Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem ⋮ Path-based supports for hypergraphs ⋮ Short plane supports for spatial hypergraphs ⋮ Path-Based Supports for Hypergraphs ⋮ Blocks of Hypergraphs ⋮ The complete optimal stars-clustering-tree problem ⋮ Network construction with subgraph connectivity constraints ⋮ Equal-need sharing of a network under connectivity constraints ⋮ Short Plane Supports for Spatial Hypergraphs ⋮ Unnamed Item

This page was built for publication: The clustering matroid and the optimal clustering tree