ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 2111.10699
  4. Cited By
Correlation Clustering via Strong Triadic Closure Labeling: Fast
  Approximation Algorithms and Practical Lower Bounds

Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds

20 November 2021
Nate Veldt
ArXivPDFHTML

Papers citing "Correlation Clustering via Strong Triadic Closure Labeling: Fast Approximation Algorithms and Practical Lower Bounds"

4 / 4 papers shown
Title
A 4-approximation algorithm for min max correlation clustering
A 4-approximation algorithm for min max correlation clustering
Holger Heidrich
Jannik Irmai
Bjoern Andres
16
5
0
13 Oct 2023
Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!
Single-Pass Pivot Algorithm for Correlation Clustering. Keep it simple!
Sayak Chakrabarty
K. Makarychev
30
16
0
23 May 2023
Partial Optimality in Cubic Correlation Clustering
Partial Optimality in Cubic Correlation Clustering
David Stein
Silvia Di Gregorio
Bjoern Andres
11
1
0
09 Feb 2023
Differentially Private Correlation Clustering
Differentially Private Correlation Clustering
Mark Bun
Marek Eliáš
Janardhan Kulkarni
34
20
0
17 Feb 2021
1