{"id":"https://openalex.org/W4394663055","doi":"https://doi.org/10.1145/3618260.3649712","title":"Combinatorial Correlation Clustering","display_name":"Combinatorial Correlation Clustering","publication_year":2024,"publication_date":"2024-06-10","ids":{"openalex":"https://openalex.org/W4394663055","doi":"https://doi.org/10.1145/3618260.3649712"},"language":"en","primary_location":{"id":"doi:10.1145/3618260.3649712","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649712","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649712","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"preprint","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649712","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5074251728","display_name":"Vincent Cohen-Addad","orcid":"https://orcid.org/0000-0002-0779-8962"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Vincent Cohen-Addad","raw_affiliation_strings":["Google Research, Paris, France"],"raw_orcid":"https://orcid.org/0000-0002-0779-8962","affiliations":[{"raw_affiliation_string":"Google Research, Paris, France","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5049863799","display_name":"David Rasmussen Lolck","orcid":"https://orcid.org/0000-0001-8835-0926"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"David Rasmussen Lolck","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-8835-0926","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5059330513","display_name":"Marcin Pilipczuk","orcid":"https://orcid.org/0000-0001-5680-7397"},"institutions":[{"id":"https://openalex.org/I4654613","display_name":"University of Warsaw","ror":"https://ror.org/039bjqg32","country_code":"PL","type":"education","lineage":["https://openalex.org/I4654613"]}],"countries":["PL"],"is_corresponding":false,"raw_author_name":"Marcin Pilipczuk","raw_affiliation_strings":["University of Warsaw, Warsaw, Poland"],"raw_orcid":"https://orcid.org/0000-0001-5680-7397","affiliations":[{"raw_affiliation_string":"University of Warsaw, Warsaw, Poland","institution_ids":["https://openalex.org/I4654613"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5039232562","display_name":"Mikkel Thorup","orcid":"https://orcid.org/0000-0001-5237-1709"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Mikkel Thorup","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-5237-1709","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114148024","display_name":"Shuyi Yan","orcid":null},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Shuyi Yan","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0001-9439-8942","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]},{"author_position":"last","author":{"id":null,"display_name":"Hanwen Zhang","orcid":"https://orcid.org/0000-0002-3149-7799"},"institutions":[{"id":"https://openalex.org/I124055696","display_name":"University of Copenhagen","ror":"https://ror.org/035b05819","country_code":"DK","type":"education","lineage":["https://openalex.org/I124055696"]}],"countries":["DK"],"is_corresponding":false,"raw_author_name":"Hanwen Zhang","raw_affiliation_strings":["University of Copenhagen, Copenhagen, Denmark"],"raw_orcid":"https://orcid.org/0000-0002-3149-7799","affiliations":[{"raw_affiliation_string":"University of Copenhagen, Copenhagen, Denmark","institution_ids":["https://openalex.org/I124055696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":6,"corresponding_author_ids":["https://openalex.org/A5074251728"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2711,"has_fulltext":true,"cited_by_count":4,"citation_normalized_percentile":{"value":0.82126318,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1617","last_page":"1628"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.9987999796867371,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11106","display_name":"Data Management and Algorithms","score":0.9973999857902527,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10057","display_name":"Face and Expression Recognition","score":0.991599977016449,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6784996390342712},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.662078857421875},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6150458455085754},{"id":"https://openalex.org/keywords/cluster-analysis","display_name":"Cluster analysis","score":0.5740704536437988},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5264756679534912},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5053711533546448},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.4430701732635498},{"id":"https://openalex.org/keywords/exponential-time-hypothesis","display_name":"Exponential time hypothesis","score":0.41989415884017944},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4013069272041321},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.31784093379974365}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6784996390342712},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.662078857421875},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6150458455085754},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.5740704536437988},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5264756679534912},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5053711533546448},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.4430701732635498},{"id":"https://openalex.org/C71017364","wikidata":"https://www.wikidata.org/wiki/Q5421532","display_name":"Exponential time hypothesis","level":3,"score":0.41989415884017944},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4013069272041321},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.31784093379974365},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/3618260.3649712","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649712","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649712","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},{"id":"pmh:oai:arXiv.org:2404.05433","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2404.05433","pdf_url":"https://arxiv.org/pdf/2404.05433","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"pmh:oai:pure.atira.dk:publications/9b5bce9f-1a03-4a3f-b8ff-3634432fec3a","is_oa":true,"landing_page_url":"https://researchprofiles.ku.dk/da/publications/9b5bce9f-1a03-4a3f-b8ff-3634432fec3a","pdf_url":"https://curis.ku.dk/ws/files/414442962/Combinatorial_Correlation_Clustering.pdf","source":{"id":"https://openalex.org/S4306401983","display_name":"Research at the University of Copenhagen (University of Copenhagen)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I124055696","host_organization_name":"University of Copenhagen","host_organization_lineage":["https://openalex.org/I124055696"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Cohen-Addad , V , Lolck , D R , Pilipczuk , M , Thorup , M , Yan , S & Zhang , H 2024 , Combinatorial Correlation Clustering . in B Mohar , I Shinkar & R O\ufffdDonnell (eds) , STOC 2024 - Proceedings of the 56th Annual ACM Symposium on Theory of Computing . Association for Computing Machinery , Proceedings of the Annual ACM Symposium on Theory of Computing , pp. 1617-1628 , 56th Annual ACM Symposium on Theory of Computing, STOC 2024 , Vancouver , Canada , 24/06/2024 . https://doi.org/10.1145/3618260.3649712","raw_type":"contributionToPeriodical"}],"best_oa_location":{"id":"doi:10.1145/3618260.3649712","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3618260.3649712","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3618260.3649712","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 56th Annual ACM Symposium on Theory of Computing","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4422840520","display_name":null,"funder_award_id":"16582","funder_id":"https://openalex.org/F4320310490","funder_display_name":"Villum Fonden"}],"funders":[{"id":"https://openalex.org/F4320310490","display_name":"Villum Fonden","ror":"https://ror.org/007ww2d15"},{"id":"https://openalex.org/F4320334966","display_name":"Bhabha Atomic Research Centre","ror":"https://ror.org/05w6wfp17"}],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4394663055.pdf"},"referenced_works_count":22,"referenced_works":["https://openalex.org/W1978658266","https://openalex.org/W1985875030","https://openalex.org/W2020254000","https://openalex.org/W2035836267","https://openalex.org/W2087187685","https://openalex.org/W2091858563","https://openalex.org/W2117654132","https://openalex.org/W2146081992","https://openalex.org/W2161719898","https://openalex.org/W2164625277","https://openalex.org/W2171179180","https://openalex.org/W2972259791","https://openalex.org/W3036999547","https://openalex.org/W3104252707","https://openalex.org/W4309237947","https://openalex.org/W4313227193","https://openalex.org/W4313227747","https://openalex.org/W4316652477","https://openalex.org/W4378464683","https://openalex.org/W4384390273","https://openalex.org/W4390098347","https://openalex.org/W4390575882"],"related_works":["https://openalex.org/W2962917430","https://openalex.org/W1598028160","https://openalex.org/W2028468530","https://openalex.org/W3172736027","https://openalex.org/W4299801389","https://openalex.org/W4307324288","https://openalex.org/W2574604093","https://openalex.org/W3186611761","https://openalex.org/W2775068415","https://openalex.org/W4214914101"],"abstract_inverted_index":{"Correlation":[0],"Clustering":[1],"is":[2,22,50,60,189],"a":[3,17,115,137,144,163,166,193,210,217,240],"classic":[4,104,182],"clustering":[5],"objective":[6],"arising":[7],"in":[8,95,117,143,149,165,171,176,180,197,222,228,232,245],"numerous":[9],"machine":[10],"learning":[11],"and":[12,52,66,100,111,133,175,236],"data":[13],"mining":[14],"applications.":[15],"Given":[16],"graph":[18],"G=(V,E),":[19],"the":[20,25,34,41,53,83,150,172,181,233,246],"goal":[21],"to":[23,32,82,191],"partition":[24],"vertex":[26],"set":[27],"into":[28],"clusters":[29,39],"so":[30],"as":[31],"minimize":[33],"number":[35,42,146,168,242],"of":[36,43,86,108,147,169,243],"edges":[37,44],"between":[38],"plus":[40],"missing":[45],"within":[46],"clusters.":[47],"The":[48,103],"problem":[49,142,203],"APX-hard":[51],"best":[54],"known":[55],"polynomial":[56],"time":[57,179,226],"approximation":[58,213],"factor":[59],"1.73":[61],"by":[62],"Cohen-Addad,":[63],"Lee,":[64],"Li,":[65],"Newman":[67,112],"[FOCS\u201923].":[68],"They":[69,185],"use":[70],"an":[71,205],"LP":[72],"with":[73,204],"|V|1/\u0454\u0398(1)":[74],"variables":[75],"for":[76,140],"some":[77],"small":[78],"\u0454.":[79],"However,":[80],"due":[81],"practical":[84],"relevance":[85],"correlation":[87],"clustering,":[88],"there":[89],"has":[90],"also":[91],"been":[92],"great":[93],"interest":[94],"getting":[96],"more":[97],"efficient":[98,206],"sequential":[99,183,225],"parallel":[101],"algorithms.":[102],"combinatorial":[105,207],"pivot":[106],"algorithm":[107,208],"Ailon,":[109],"Charikar":[110],"[JACM\u201908]":[113],"provides":[114],"3-approximation":[116,196],"linear":[118],"time.":[119],"Like":[120],"most":[121],"other":[122],"algorithms":[123],"discussed":[124],"here,":[125],"this":[126,202],"uses":[127,238],"randomization.":[128],"Recently,":[129],"Behnezhad,":[130],"Charikar,":[131],"Ma":[132],"Tan":[134],"[FOCS\u201922]":[135],"presented":[136],"3+\u0454-approximate":[138],"solution":[139],"solving":[141],"constant":[145,241],"rounds":[148,170,244],"Massively":[151],"Parallel":[152],"Computation":[153],"(MPC)":[154],"setting.":[155,184],"Very":[156],"recently,":[157],"Cao,":[158],"Huang,":[159],"Su":[160],"[SODA\u201924]":[161],"provided":[162],"2.4-approximation":[164],"polylogarithmic":[167],"MPC":[173,247],"model":[174],"\u00d5":[177],"(|E|1.5)":[178],"asked":[186],"whether":[187],"it":[188,237],"possible":[190],"get":[192],"better":[194,212],"than":[195],"near-linear":[198],"time?":[199],"We":[200],"resolve":[201],"providing":[209],"drastically":[211],"factor.":[214],"It":[215],"achieves":[216],"\u223c":[218],"2\u22122/13":[219],"<":[220],"1.847-approximation":[221],"sub-linear":[223,229],"(\u00d5(|V|))":[224,230],"or":[227],"space":[231],"streaming":[234],"setting,":[235],"only":[239],"model.":[248]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":1}],"updated_date":"2026-05-19T08:33:51.333923","created_date":"2025-10-10T00:00:00"}