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
v1v2 (latest)

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

20 November 2021
Nate Veldt
ArXiv (abs)PDFHTML

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

2 / 2 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
42
6
0
13 Oct 2023
Partial Optimality in Cubic Correlation Clustering
Partial Optimality in Cubic Correlation Clustering
David Stein
Silvia Di Gregorio
Bjoern Andres
98
1
0
09 Feb 2023
1