Approximation algorithms for two variants of correlation clustering problem
From MaRDI portal
Publication:2156281
DOI10.1007/S10878-020-00612-1zbMATH Open1495.90155OpenAlexW3037434073MaRDI QIDQ2156281FDOQ2156281
Authors: Sai Ji, M. Li, Yishui Wang, Dachuan Xu 
Publication date: 18 July 2022
Published in: Journal of Combinatorial Optimization (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10878-020-00612-1
Recommendations
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Approximation algorithm for the capacitated correlation clustering problem with penalties
- Algorithms - ESA 2003
- A semidefinite programming rounding algorithm for correlation clustering problem
- Correlation clustering in general weighted graphs
approximation algorithmcorrelation clusteringuncertain graphsnon-uniform hard constrained cluster sizes
Cites Work
- Title not available (Why is that?)
- Correlation clustering with noisy input
- Clustering with qualitative information
- Aggregating inconsistent information: ranking and clustering
- Correlation clustering
- Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
- Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
- A 3-approximation algorithm for the facility location problem with uniform capacities
- Approximation algorithms for hard capacitated \(k\)-facility location problems
- Correlation clustering in general weighted graphs
- Correlation clustering, maximizing agreements via semidefinite programming
- Deterministic pivoting algorithms for constrained ranking and clustering problems
- Improved approximation algorithms for bipartite correlation clustering
- Correlation clustering with a fixed number of clusters
- Correlation clustering in data streams
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- On uniform capacitated \(k\)-median beyond the natural LP relaxation
- Bi-factor approximation algorithms for hard capacitated \(k\)-median problems
- Correlation Clustering and Biclustering With Locally Bounded Errors
- Better guarantees for \(k\)-means and Euclidean \(k\)-median by primal-dual algorithms
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Online correlation clustering
- Clustering problems on sliding windows
- A streaming algorithm for \(k\)-means with approximate coreset
Cited In (17)
- A Local-Search 2-Approximation for 2-Correlation-Clustering
- Improved Approximation Algorithms for Bipartite Correlation Clustering
- Contraction methods for correlation clustering: the order is important
- Correlation clustering with constrained cluster sizes and extended weights bounds
- Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem
- On the hardness of labeled correlation clustering problem: a parameterized complexity view
- Integer programming formulations and efficient local search for relaxed correlation clustering
- A 2-approximation algorithm for the graph 2-clustering problem
- Approximation Algorithms for Matroid and Knapsack Means Problems
- Title not available (Why is that?)
- Approximation algorithms for the capacitated correlation clustering problem with penalties
- Approximation algorithm for the capacitated correlation clustering problem with penalties
- A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis
- Approximate correlation clustering using same-cluster queries
- Approximation algorithms for the lower bounded correlation clustering problem
This page was built for publication: Approximation algorithms for two variants of correlation clustering problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2156281)
