Approximation algorithms for the lower bounded correlation clustering problem
From MaRDI portal
Publication:2677653
Recommendations
- Approximation algorithms for the capacitated correlation clustering problem with penalties
- Approximation algorithms for two variants of correlation clustering problem
- Algorithms and complexity results for labeled correlation clustering problem
- Approximation algorithm for the capacitated correlation clustering problem with penalties
- A semidefinite programming rounding algorithm for correlation clustering problem
Cites work
- Approximation algorithms for the lower-bounded \(k\)-median and its generalizations
- Clustering with qualitative information
- Correlation clustering
- Correlation clustering generalized
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Correlation clustering with noisy input
- Correlation clustering with same-cluster queries bounded by optimal cost
- Correlation clustering, maximizing agreements via semidefinite programming
- Improved approximation algorithms for bipartite correlation clustering
- Improved approximation guarantees for lower-bounded facility location
- Lower-bounded facility location
- LP-based pivoting algorithm for higher-order correlation clustering
- Min-max correlation clustering via multicut
- Motif and Hypergraph Correlation Clustering
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- On facility location with general lower bounds
- Sorting noisy data with partial information
Cited in
(9)- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs
- Approximation algorithms for the capacitated correlation clustering problem with penalties
- Approximation algorithm for the capacitated correlation clustering problem with penalties
- Algorithms and complexity results for labeled correlation clustering problem
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- Improved Approximation Algorithms for Bipartite Correlation Clustering
- scientific article; zbMATH DE number 6351476 (Why is no real title available?)
- An improved approximation algorithm for the capacitated correlation clustering problem
- On the hardness of labeled correlation clustering problem: a parameterized complexity view
This page was built for publication: Approximation algorithms for the lower bounded correlation clustering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2677653)
