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. 2307.06723
  4. Cited By
Breaking 3-Factor Approximation for Correlation Clustering in
  Polylogarithmic Rounds

Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds

13 July 2023
Nairen Cao
Shang-En Huang
Hsin-Hao Su
ArXivPDFHTML

Papers citing "Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds"

2 / 2 papers shown
Title
Sublinear Time and Space Algorithms for Correlation Clustering via
  Sparse-Dense Decompositions
Sublinear Time and Space Algorithms for Correlation Clustering via Sparse-Dense Decompositions
Sepehr Assadi
Chen Wang
33
32
0
29 Sep 2021
Differentially Private Correlation Clustering
Differentially Private Correlation Clustering
Mark Bun
Marek Eliáš
Janardhan Kulkarni
27
20
0
17 Feb 2021
1