Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs

DOI10.1145/2746539.2746604zbMath1321.68495arXiv1412.0681OpenAlexW1988153470MaRDI QIDQ2941510

Konstantin Makarychev, Shuchi Chawla, Tselil Schramm, Grigory Yaroslavtsev

Publication date: 21 August 2015

Published in: Proceedings of the forty-seventh annual ACM symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1412.0681

zbMATH Keywords

approximation algorithmscorrelation clustering

Mathematics Subject Classification ID

Linear programming (90C05) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Signed and weighted graphs (05C22)

Related Items (23)

Fair correlation clustering with global and local guarantees ⋮ An improved approximation algorithm for capacitated correlation clustering problem ⋮ Approximation algorithm for min-max correlation clustering problem with outliers ⋮ Approximation algorithm for the capacitated correlation clustering problem with penalties ⋮ Approximation algorithms for two variants of correlation clustering problem ⋮ Correlation Clustering with Constrained Cluster Sizes and Extended Weights Bounds ⋮ Correlation clustering and two-edge-connected augmentation for planar graphs ⋮ Approximation Algorithms for the Capacitated Min–Max Correlation Clustering Problem ⋮ Approximation algorithms for the lower bounded correlation clustering problem ⋮ A combinatorial multi-armed bandit approach to correlation clustering ⋮ Unnamed Item ⋮ A polyhedral study of lifted multicuts ⋮ Unnamed Item ⋮ APPROXIMATE ALGORITHMS FOR GRAPH CLUSTERING PROBLEM ⋮ Unnamed Item ⋮ Unnamed Item ⋮ Unnamed Item ⋮ LP-based pivoting algorithm for higher-order correlation clustering ⋮ Correlation clustering in data streams ⋮ Approximation algorithm for the balanced 2-correlation clustering problem on well-proportional graphs ⋮ A literature review on correlation clustering: cross-disciplinary taxonomy with bibliometric analysis ⋮ Approximation algorithms for the capacitated correlation clustering problem with penalties ⋮ Metric-Constrained Optimization for Graph Clustering Algorithms

Uses Software

• Graphs

Cites Work

• Unnamed Item
• Ramsey partitions and proximity data structures
• On sparse spanners of weighted graphs
• Scale-oblivious metric fragmentation and the nonlinear Dvoretzky theorem
• On Approximate Distance Labels and Routing Schemes with Affine Stretch
• Distance Oracles for Unweighted Graphs: Breaking the Quadratic Barrier with Constant Additive Error
• Approximate distance oracles
• Fast Algorithms for Constructing t-Spanners and Paths with Stretch t
• Near-Linear Time Construction of Sparse Neighborhood Covers
• Shortest-path queries in static networks
• Approximate distance oracles with constant query time
• Automata, Languages and Programming

This page was built for publication: Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs