Approximation algorithm for min-max correlation clustering problem with outliers
From MaRDI portal
Publication:2150588
DOI10.1007/978-3-030-92681-6_52OpenAlexW4205578186MaRDI QIDQ2150588
Zhenning Zhang, Min Li, Mei Liang, Sai Ji
Publication date: 29 June 2022
Full work available at URL: https://doi.org/10.1007/978-3-030-92681-6_52
Combinatorial optimization (90C27) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20)
Cites Work
- Unnamed Item
- Unnamed Item
- Correlation clustering
- Data-driven distributionally robust capacitated facility location problem
- An LP-rounding based algorithm for a capacitated uniform facility location problem with penalties
- Local guarantees in graph cuts and clustering
- Clustering with qualitative information
- Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
- Sorting noisy data with partial information
- Correlation clustering with a fixed number of clusters
- Improved Approximation Algorithms for Bipartite Correlation Clustering
- Motif and Hypergraph Correlation Clustering
- Bi-Factor Approximation Algorithms for Hard Capacitated k-Median Problems
- Correlation Clustering and Biclustering With Locally Bounded Errors
- Aggregating inconsistent information
- LP-based pivoting algorithm for higher-order correlation clustering
This page was built for publication: Approximation algorithm for min-max correlation clustering problem with outliers
