Pages that link to "Item:Q1424305"
From MaRDI portal
The following pages link to The clustering matroid and the optimal clustering tree (Q1424305):
Displaying 21 items.
- A matching algorithm in PMWL based on CluTree (Q265007) (← links)
- On the approximability and hardness of minimum topic connected overlay and its special instances (Q418776) (← links)
- Path-based supports for hypergraphs (Q450570) (← links)
- Equal-need sharing of a network under connectivity constraints (Q536106) (← links)
- Complexity dichotomies for the \textsc{Minimum} \(\mathcal{F}\)-\textsc{Overlay} problem (Q1711667) (← links)
- Short plane supports for spatial hypergraphs (Q1725733) (← links)
- Network construction with subgraph connectivity constraints (Q2253960) (← links)
- The complete optimal stars-clustering-tree problem (Q2473041) (← links)
- Vertices removal for feasibility of clustered spanning trees (Q2663996) (← links)
- Online and approximate network construction from bounded connectivity constraints (Q2692731) (← links)
- Clustering in trees: Optimizing cluster sizes and number of subtrees (Q2701746) (← links)
- Twins in Subdivision Drawings of Hypergraphs (Q2961505) (← links)
- Path-Based Supports for Hypergraphs (Q3000490) (← links)
- Blocks of Hypergraphs (Q3000508) (← links)
- On the Optimal Stars Clustering Tree Problem (Q3439552) (← links)
- (Q3504608) (← links)
- Approximation Algorithms for Not Necessarily Disjoint Clustered TSP (Q4554892) (← links)
- (Q5136326) (← links)
- Short Plane Supports for Spatial Hypergraphs (Q5233132) (← links)
- Online and Approximate Network Construction from Bounded Connectivity Constraints (Q6175211) (← links)
- The role of twins in computing planar supports of hypergraphs (Q6616221) (← links)
