scientific article; zbMATH DE number 7758351

DOI10.4230/LIPICS.APPROX/RANDOM.2020.49MaRDI QIDQ6084411zbMATH OpenFDO

Authors Roy Schwartz

Publication date 31 October 2023

Full work available at URL https://doi.org/10.4230/LIPICS.APPROX/RANDOM.2020.49

zbMATH Keywords

approximationcorrelation clusteringGrothendieck's inequality

Mathematics Subject Classification ID

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

Cites work

• A Local-Search 2-Approximation for 2-Correlation-Clustering
• Aggregating inconsistent information: ranking and clustering
• Approximating the cut-norm via Grothendieck's inequality
• Clustering with qualitative information
• Correlation clustering
• Correlation clustering in general weighted graphs
• Correlation clustering with a fixed number of clusters
• Improved approximation algorithms for bipartite correlation clustering
• Improved approximation algorithms for MAX k-cut and MAX BISECTION
• Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs
• Quadratic forms on graphs
• The design of approximation algorithms
• The Grothendieck Constant is Strictly Smaller than Krivine's Bound

Cited in

(1)

• Maximizing a correlational ratio for linear extensions of posets

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6084411)