Fast Combinatorial Algorithms for Min Max Correlation Clustering

Davies, S.; Moseley, B.; Newman, H.

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Thursday, October 10 until 2:00 AM ET on Friday, October 11 due to maintenance. We apologize for the inconvenience.

Explore Research Products in the NSF-PAR

+ Advanced Search

Citation Details

This content will become publicly available on November 1, 2024

Fast Combinatorial Algorithms for Min Max Correlation Clustering

Award ID(s):: 2121744 1845146

NSF-PAR ID:: 10475846

Author(s) / Creator(s):: Davies, S.; Moseley, B.; Newman, H.

Publisher / Repository:: PMLR

Date Published:: 2023-11-01

Journal Name:: ICML

Format(s):: Medium: X

Sponsoring Org:: National Science Foundation

Free Publicly Accessible Full Text
This content will become publicly available on November 1, 2024
Conference Paper:
The DOI is not currently available.

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