Pages that link to "Item:Q1566100"
From MaRDI portal
The following pages link to NP-hard approximation problems in overlapping clustering. (Q1566100):
Displayed 16 items.
- Seriation in the presence of errors: NP-hardness of \(l_{\infty}\)-fitting Robinson structures to dissimilarity matrices (Q263094) (← links)
- An optimal algorithm to recognize Robinsonian dissimilarities (Q269174) (← links)
- Graph-based data clustering with overlaps (Q456688) (← links)
- On critical sets of a finite Moore family (Q481926) (← 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)
- Reconstruction of line-embeddings of graphons (Q2136610) (← links)
- ADCLUS and INDCLUS: analysis, experimentation, and meta-heuristic algorithm extensions (Q2418313) (← links)
- Combinatorial optimisation and hierarchical classifications (Q2480261) (← links)
- Sub-dominant theory in numerical taxonomy (Q2489653) (← links)
- An Optimization Parameter for Seriation of Noisy Data (Q5376542) (← links)
- A Simple and Optimal Algorithm for Strict Circular Seriation (Q5888295) (← links)
- Modules in Robinson Spaces (Q6187080) (← links)