Correlation clustering generalized
From MaRDI portal
Recommendations
Cites work
- \(O(\sqrt{\log n})\) approximation algorithms for Min UnCut, Min 2CNF deletion, and directed cut problems
- A Local-Search 2-Approximation for 2-Correlation-Clustering
- Aggregating inconsistent information: ranking and clustering
- Algorithmic and Complexity Results for Decompositions of Biological Networks into Monotone Subsystems
- Clustering with qualitative information
- Correlation clustering
- Correlation clustering in general weighted graphs
- Correlation clustering with a fixed number of clusters
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Entropy waves, the zig-zag graph product, and new constant-degree expanders
- LP-based pivoting algorithm for higher-order correlation clustering
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- On the hardness of approximating Multicut and Sparsest-Cut
- On the power of unique 2-prover 1-round games
Cited in
(6)- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Correlation clustering in general weighted graphs
- Approximation algorithms for the lower bounded correlation clustering problem
- Correlation Clustering
- Graph Clustering in All Parameter Regimes
- Correlation clustering
This page was built for publication: Correlation clustering generalized
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5091036)