{"id":"https://openalex.org/W4390575673","doi":"https://doi.org/10.1137/1.9781611977912.143","title":"Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds","display_name":"Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds","publication_year":2024,"publication_date":"2024-01-01","ids":{"openalex":"https://openalex.org/W4390575673","doi":"https://doi.org/10.1137/1.9781611977912.143"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611977912.143","doi":"https://doi.org/10.1137/1.9781611977912.143","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611977912.143","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},"volume":{"id":"https://openalex.org/W4390575860","display_name":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)"},"type":"conference-paper","is_traditional":true,"indexed_in":["arxiv","crossref","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2307.06723","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5030710270","display_name":"Nairen Cao","orcid":"https://orcid.org/0000-0002-4961-763X","observed_orcids":["https://orcid.org/0000-0002-4961-763X"]},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Nairen Cao","raw_affiliation_strings":["Boston College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston College","institution_ids":["https://openalex.org/I103531236"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5086319053","display_name":"Shang-En Huang","orcid":"https://orcid.org/0000-0002-9799-0981","observed_orcids":["https://orcid.org/0000-0002-9799-0981"]},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Shang-En Huang","raw_affiliation_strings":["Boston College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston College","institution_ids":["https://openalex.org/I103531236"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5005437771","display_name":"Hsin-Hao Su","orcid":"https://orcid.org/0009-0002-7970-9604","observed_orcids":["https://orcid.org/0009-0002-7970-9604","https://orcid.org/0000-0003-3838-8349"]},"institutions":[{"id":"https://openalex.org/I103531236","display_name":"Boston College","ror":"https://ror.org/02n2fzt79","country_code":"US","type":"education","lineage":["https://openalex.org/I103531236"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Hsin-Hao SU","raw_affiliation_strings":["Boston College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Boston College","institution_ids":["https://openalex.org/I103531236"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I103531236"],"apc_list":null,"apc_paid":null,"fwci":3.3524,"has_fulltext":true,"cited_by_count":9,"citation_normalized_percentile":{"value":0.9254133,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":91,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"4124","last_page":"4154"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.986299991607666,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T10637","display_name":"Advanced Clustering Algorithms Research","score":0.006000000052154064,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.0006000000284984708,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/correlation-clustering","display_name":"correlation clustering","score":1.0},{"id":"https://openalex.org/keywords/parallel-algorithms","display_name":"parallel algorithms","score":0.722000002861023},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.9279999732971191},{"id":"https://openalex.org/keywords/cluster-partitioning","display_name":"cluster partitioning","score":0.531000018119812},{"id":"https://openalex.org/keywords/combinatorial-optimization","display_name":"combinatorial optimization","score":0.5659999847412109}],"concepts":[{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7167249917984009},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6824968457221985},{"id":"https://openalex.org/C73555534","wikidata":"https://www.wikidata.org/wiki/Q622825","display_name":"Cluster analysis","level":2,"score":0.6345061659812927},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5741331577301025},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.5139219760894775},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5061966776847839},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4896243214607239},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4818612039089203},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46609628200531006},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.44580212235450745},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4030243158340454},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3574475049972534},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1137/1.9781611977912.143","doi":"https://doi.org/10.1137/1.9781611977912.143","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611977912.143","pdf_url":null,"source":{"id":"https://openalex.org/S4306463922","display_name":"Society for Industrial and Applied Mathematics eBooks","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"ebook platform"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","raw_type":"book-chapter"},{"id":"pmh:oai:arXiv.org:2307.06723","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2307.06723","pdf_url":"https://arxiv.org/pdf/2307.06723","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":"doi:10.48550/arxiv.2307.06723","doi":"https://doi.org/10.48550/arxiv.2307.06723","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2307.06723","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2307.06723","doi":null,"is_oa":true,"landing_page_url":"http://arxiv.org/abs/2307.06723","pdf_url":"https://arxiv.org/pdf/2307.06723","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"listed_in":[],"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"},"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G7995651076","display_name":"AF: Small: Combinatorial Optimization Problems in Vertex Centric Computation","funder_award_id":"2008422","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W4390575673.pdf","grobid_xml":"https://content.openalex.org/works/W4390575673.grobid-xml"},"referenced_works_count":1,"referenced_works":["https://openalex.org/W4408033589"],"related_works":["https://openalex.org/W4313227193","https://openalex.org/W4394663055","https://openalex.org/W6891622352","https://openalex.org/W4293566545","https://openalex.org/W4390098347","https://openalex.org/W927681281","https://openalex.org/W3168052942","https://openalex.org/W7110032422","https://openalex.org/W3206609803","https://openalex.org/W4286851454"],"abstract_inverted_index":{"In":[0,56],"this":[1],"paper,":[2],"we":[3],"study":[4],"parallel":[5,46],"algorithms":[6,47,68],"for":[7],"the":[8,30,36,41,59],"correlation":[9],"clustering":[10],"problem,":[11],"where":[12],"every":[13],"pair":[14],"of":[15,38,52],"two":[16],"different":[17],"entities":[18,31],"is":[19,27],"labeled":[20],"with":[21,40,58],"similar":[22],"or":[23],"dissimilar.":[24],"The":[25],"goal":[26],"to":[28,34],"partition":[29],"into":[32],"clusters":[33],"minimize":[35],"number":[37],"disagreements":[39],"labels.":[42],"Currently,":[43],"all":[44],"efficient":[45],"have":[48],"an":[49],"approximation":[50],"ratio":[51,63],"at":[53],"least":[54],"3.":[55],"comparison":[57],"1.994":[60],"+":[61],"\u025b":[62],"achieved":[64],"by":[65],"polynomial-time":[66],"sequential":[67],"[25],":[69],"a":[70],"significant":[71],"gap":[72],"exists.":[73]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":4}],"updated_date":"2026-11-07T11:25:07.637180","created_date":"2024-01-05T00:00:00"}