scientific article; zbMATH DE number 7758351

DOI10.4230/lipics.approx/random.2020.49MaRDI QIDQ6084411

Unnamed Author, Roy Schwartz

Publication date: 31 October 2023

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

approximationcorrelation clusteringGrothendieck's inequality

Mathematics Subject Classification ID

Combinatorial optimization (90C27) Approximation algorithms (68W25) Randomized algorithms (68W20)

Cites Work

• Unnamed Item
• Improved approximation algorithms for MAX \(k\)-cut and MAX BISECTION
• Correlation clustering
• Correlation clustering in general weighted graphs
• Clustering with qualitative information
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• The Design of Approximation Algorithms
• A Local-Search 2-Approximation for 2-Correlation-Clustering
• Approximating the cut-norm via Grothendieck's inequality
• Improved Approximation Algorithms for Bipartite Correlation Clustering
• The Grothendieck Constant is Strictly Smaller than Krivine's Bound
• Quadratic forms on graphs
• Aggregating inconsistent information

This page was built for publication: