Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms

Assadi, Sepehr; Khanna, Sanjeev; Putterman, Aaron

doi:10.1145/3717823.3718194

Attention:

The NSF Public Access Repository (PAR) system and access will be unavailable from 10:00 PM ET on Friday, February 6 until 10:00 AM ET on Saturday, February 7 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the PAR
It may take a few hours for recently added research products to appear in PAR search results.

+ Advanced Search

Citation Details

Correlation Clustering and (De)Sparsification: Graph Sketches Can Match Classical Algorithms

Award ID(s):: 2402284 2008305

PAR ID:: 10610223

Author(s) / Creator(s):: Assadi, Sepehr; Khanna, Sanjeev; Putterman, Aaron

Publisher / Repository:: ACM

Date Published:: 2025-06-15

ISBN:: 9798400715105

Page Range / eLocation ID:: 417 to 428

Format(s):: Medium: X

Location:: Prague Czechia

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
Accepted Manuscript
Conference Paper:
https://doi.org/10.1145/3717823.3718194

Last Name:

First Name:

Search Results
Selected Authors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match authors that most closely relate to the text you typed.

No authors are currently selected. Choosing "Select These Authors" will enter a blank value for author search in the parent form.

Last Name:

First Name:

Search Results
Selected Editors

Type in a name, or the first few letters of a name, in one or both of appropriate search boxes above and select the search button. An attempt will be made to match editors that most closely relate to the text you typed.

No editors are currently selected. Choosing "Select These Editors" will enter a blank value for editor search in the parent form.

More Like this