Correlation clustering with Sherali-Adams
From MaRDI portal
Cited in
(12)- Simultaneously approximating all _p-norms in correlation clustering
- Improved combinatorial approximations for weighted correlation clustering
- Approximation algorithm for min-max correlation clustering problem with penalties
- An FPT constant-factor approximation algorithm for correlation clustering
- Combinatorial optimization. Abstracts from the workshop held November 10--15, 2024
- A (3+)-approximate correlation clustering algorithm in dynamic streams
- Fitting distances by tree metrics minimizing the total error within a constant factor
- Recent progress on correlation clustering: from local algorithms to better approximation algorithms and back (invited talk)
- Min-Max correlation clustering via neighborhood similarity
- Simultaneously approximating all norms for massively parallel correlation clustering
- Fitting tree metrics and ultrametrics in data streams
- 1.64-approximation for chromatic correlation clustering via chromatic cluster LP
This page was built for publication: Correlation clustering with Sherali-Adams
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6943024)