An improved approximation algorithm for the capacitated correlation clustering problem
From MaRDI portal
Recommendations
- Approximation algorithm for the capacitated correlation clustering problem with penalties
- Approximation algorithms for the capacitated correlation clustering problem with penalties
- Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
- Approximation algorithms for the lower bounded correlation clustering problem
- Approximation algorithms for two variants of correlation clustering problem
Cites work
- Aggregating inconsistent information: ranking and clustering
- Approximating k-median via pseudo-approximation
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Clustering with qualitative information
- Correlation clustering
- Correlation clustering in data streams
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Correlation clustering with noisy input
- Improved approximation algorithms for bipartite correlation clustering
- Local Search Yields Approximation Schemes for k-Means and k-Median in Euclidean and Minor-Free Metrics
- Min-max correlation clustering via multicut
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
This page was built for publication: An improved approximation algorithm for the capacitated correlation clustering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6610093)
