Pages that link to "Item:Q1566100"
From MaRDI portal
The following pages link to NP-hard approximation problems in overlapping clustering. (Q1566100):
Displayed 8 items.
- Graph-based data clustering with overlaps (Q456688) (← links)
- Seriation in the presence of errors: a factor 16 approximation algorithm for \(l_{\infty }\)-fitting Robinson structures to distances (Q633846) (← links)
- Systems of sets such that each set properly intersects at most one other set -- application to cluster analysis (Q947062) (← links)
- Binary clustering (Q947063) (← links)
- From hypertrees to arboreal quasi-ultrametrics (Q1766738) (← links)
- Closure systems, implicational systems, overhanging relations and the case of hierarchical classification (Q1887547) (← links)
- Combinatorial optimisation and hierarchical classifications (Q2480261) (← links)
- Sub-dominant theory in numerical taxonomy (Q2489653) (← links)