{"id":"https://openalex.org/W1988153470","doi":"https://doi.org/10.1145/2746539.2746604","title":"Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs","display_name":"Near Optimal LP Rounding Algorithm for CorrelationClustering on Complete and Complete k-partite Graphs","publication_year":2015,"publication_date":"2015-06-03","ids":{"openalex":"https://openalex.org/W1988153470","doi":"https://doi.org/10.1145/2746539.2746604","mag":"1988153470"},"language":"en","primary_location":{"id":"doi:10.1145/2746539.2746604","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746604","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5005407267","display_name":"Shuchi Chawla","orcid":"https://orcid.org/0000-0001-5583-2320"},"institutions":[{"id":"https://openalex.org/I135310074","display_name":"University of Wisconsin\u2013Madison","ror":"https://ror.org/01y2jtd41","country_code":"US","type":"education","lineage":["https://openalex.org/I135310074"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Shuchi Chawla","raw_affiliation_strings":["University of Wisconsin-Madison, Madison, WI, USA"],"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, Madison, WI, USA","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033681881","display_name":"Konstantin Makarychev","orcid":null},"institutions":[{"id":"https://openalex.org/I1290206253","display_name":"Microsoft (United States)","ror":"https://ror.org/00d0nc645","country_code":"US","type":"company","lineage":["https://openalex.org/I1290206253"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Konstantin Makarychev","raw_affiliation_strings":["Microsoft Research, Redmond, WA, USA"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, Redmond, WA, USA","institution_ids":["https://openalex.org/I1290206253"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081583404","display_name":"Tselil Schramm","orcid":"https://orcid.org/0000-0002-8494-5778"},"institutions":[{"id":"https://openalex.org/I134446601","display_name":"Berkeley College","ror":"https://ror.org/02xewxa75","country_code":"US","type":"education","lineage":["https://openalex.org/I134446601"]},{"id":"https://openalex.org/I95457486","display_name":"University of California, Berkeley","ror":"https://ror.org/01an7q238","country_code":"US","type":"education","lineage":["https://openalex.org/I95457486"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tselil Schramm","raw_affiliation_strings":["UC Berkeley, Berkeley, CA, USA"],"affiliations":[{"raw_affiliation_string":"UC Berkeley, Berkeley, CA, USA","institution_ids":["https://openalex.org/I134446601","https://openalex.org/I95457486"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001984674","display_name":"Grigory Yaroslavtsev","orcid":null},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Grigory Yaroslavtsev","raw_affiliation_strings":["University of Pennsylvania, Philadelphia, PA, USA"],"affiliations":[{"raw_affiliation_string":"University of Pennsylvania, Philadelphia, PA, USA","institution_ids":["https://openalex.org/I79576946"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5005407267"],"corresponding_institution_ids":["https://openalex.org/I135310074"],"apc_list":null,"apc_paid":null,"fwci":5.6082,"has_fulltext":false,"cited_by_count":73,"citation_normalized_percentile":{"value":0.96329247,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"219","last_page":"228"},"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.9977999925613403,"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.9977999925613403,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.994700014591217,"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/T12541","display_name":"Graph Labeling and Dimension Problems","score":0.9855999946594238,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8410305976867676},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.7553905248641968},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6678814888000488},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.664779007434845},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.6308095455169678},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.594028115272522},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4660561978816986},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.4642881155014038},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4529494345188141},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.41189518570899963},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2904062867164612},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.23023688793182373}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8410305976867676},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7553905248641968},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6678814888000488},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.664779007434845},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.6308095455169678},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.594028115272522},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4660561978816986},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.4642881155014038},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4529494345188141},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.41189518570899963},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2904062867164612},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.23023688793182373},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C77805123","wikidata":"https://www.wikidata.org/wiki/Q161272","display_name":"Social psychology","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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2746539.2746604","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2746539.2746604","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the forty-seventh annual ACM symposium on Theory of Computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G3798225939","display_name":null,"funder_award_id":"DGE 1106400, CCF-1320854","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"},{"id":"https://openalex.org/F4320308943","display_name":"Microsoft Research","ror":"https://ror.org/00d0nc645"},{"id":"https://openalex.org/F4320309370","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":38,"referenced_works":["https://openalex.org/W132912941","https://openalex.org/W206623851","https://openalex.org/W1523728576","https://openalex.org/W1581262234","https://openalex.org/W1680797894","https://openalex.org/W1855075141","https://openalex.org/W1899379166","https://openalex.org/W1982119153","https://openalex.org/W1985875030","https://openalex.org/W1999657075","https://openalex.org/W2004804027","https://openalex.org/W2017732166","https://openalex.org/W2035836267","https://openalex.org/W2050883504","https://openalex.org/W2071234528","https://openalex.org/W2091858563","https://openalex.org/W2113239207","https://openalex.org/W2114432090","https://openalex.org/W2117654132","https://openalex.org/W2132641109","https://openalex.org/W2143928137","https://openalex.org/W2146081992","https://openalex.org/W2154785834","https://openalex.org/W2161719898","https://openalex.org/W2164706093","https://openalex.org/W2295256067","https://openalex.org/W2402325143","https://openalex.org/W2604272474","https://openalex.org/W2611831635","https://openalex.org/W2914959486","https://openalex.org/W2963798309","https://openalex.org/W3036999547","https://openalex.org/W4285719527","https://openalex.org/W6631230762","https://openalex.org/W6663246153","https://openalex.org/W6676847830","https://openalex.org/W6677209044","https://openalex.org/W6830257577"],"related_works":["https://openalex.org/W2268207117","https://openalex.org/W3100114454","https://openalex.org/W2561769964","https://openalex.org/W2507810539","https://openalex.org/W2117839333","https://openalex.org/W2035016254","https://openalex.org/W2053393096","https://openalex.org/W1991979416","https://openalex.org/W1966079129","https://openalex.org/W276709744"],"abstract_inverted_index":{"We":[0,51],"give":[1],"new":[2],"rounding":[3],"schemes":[4],"for":[5],"the":[6,12,21,36],"standard":[7],"linear":[8],"programming":[9],"relaxation":[10],"of":[11,41,80],"correlation":[13],"clustering":[14],"problem,":[15],"achieving":[16],"approximation":[17,28,48,71],"factors":[18],"almost":[19,34],"matching":[20,55],"integrality":[22,39,56,78],"gaps:":[23],"For":[24,43,58],"complete":[25,44,59],"graphs":[26,46,60],"our":[27,47,70],"is":[29,49,72],"2.06":[30],"-":[31],"\u03b5,":[32],"which":[33],"matches":[35],"previously":[37],"known":[38],"gap":[40,79],"2.":[42],"k-partite":[45],"3.":[50],"also":[52],"show":[53,76],"a":[54],"gap.":[57],"with":[61],"edge":[62],"weights":[63],"satisfying":[64],"triangle":[65],"inequalities":[66],"and":[67,74],"probability":[68],"constraints,":[69],"1.5,":[73],"we":[75],"an":[77],"1.2.":[81]},"counts_by_year":[{"year":2025,"cited_by_count":4},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":8},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":14},{"year":2020,"cited_by_count":10},{"year":2019,"cited_by_count":9},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":5},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}