{"id":"https://openalex.org/W2127114399","doi":"https://doi.org/10.1145/1060590.1060675","title":"O(\u221alog n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems","display_name":"O(\u221alog n) approximation algorithms for min UnCut, min 2CNF deletion, and directed cut problems","publication_year":2005,"publication_date":"2005-05-22","ids":{"openalex":"https://openalex.org/W2127114399","doi":"https://doi.org/10.1145/1060590.1060675","mag":"2127114399"},"language":"en","primary_location":{"id":"doi:10.1145/1060590.1060675","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-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/A5074110882","display_name":"Amit Agarwal","orcid":"https://orcid.org/0000-0002-3352-0227"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Amit Agarwal","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5071016611","display_name":"Moses Charikar","orcid":"https://orcid.org/0000-0003-0807-3389"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Moses Charikar","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033681881","display_name":"Konstantin Makarychev","orcid":null},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Konstantin Makarychev","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068045392","display_name":"Yury Makarychev","orcid":"https://orcid.org/0000-0003-3114-3947"},"institutions":[{"id":"https://openalex.org/I20089843","display_name":"Princeton University","ror":"https://ror.org/00hx57361","country_code":"US","type":"education","lineage":["https://openalex.org/I20089843"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yury Makarychev","raw_affiliation_strings":["Princeton University, Princeton, NJ"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5074110882"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":18.1795,"has_fulltext":false,"cited_by_count":180,"citation_normalized_percentile":{"value":0.99644777,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"573","last_page":"581"},"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.9997000098228455,"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.9997000098228455,"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.9918000102043152,"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"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9803000092506409,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7117311358451843},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6448471546173096},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.6166179776191711},{"id":"https://openalex.org/keywords/log-log-plot","display_name":"Log-log plot","score":0.531708300113678},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5099340677261353},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.47851431369781494},{"id":"https://openalex.org/keywords/running-time","display_name":"Running time","score":0.4777223765850067},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3211416006088257}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7117311358451843},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6448471546173096},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.6166179776191711},{"id":"https://openalex.org/C195292467","wikidata":"https://www.wikidata.org/wiki/Q2091879","display_name":"Log-log plot","level":3,"score":0.531708300113678},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5099340677261353},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.47851431369781494},{"id":"https://openalex.org/C3017489831","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Running time","level":2,"score":0.4777223765850067},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3211416006088257}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1060590.1060675","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1060590.1060675","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the thirty-seventh annual ACM symposium on Theory of computing","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W97263645","https://openalex.org/W1528220564","https://openalex.org/W1964029763","https://openalex.org/W2002617302","https://openalex.org/W2020632401","https://openalex.org/W2038225707","https://openalex.org/W2043819676","https://openalex.org/W2068190866","https://openalex.org/W2077044402","https://openalex.org/W2091004914","https://openalex.org/W2093318356","https://openalex.org/W2117319425","https://openalex.org/W2120358419","https://openalex.org/W2150148016","https://openalex.org/W2167061810","https://openalex.org/W2403213103","https://openalex.org/W2626503362","https://openalex.org/W3144422206","https://openalex.org/W4239534271","https://openalex.org/W4389615663"],"related_works":["https://openalex.org/W2963158951","https://openalex.org/W1992104669","https://openalex.org/W1870020915","https://openalex.org/W2070751425","https://openalex.org/W2018076478","https://openalex.org/W1581210843","https://openalex.org/W1529390395","https://openalex.org/W1982530285","https://openalex.org/W2887154986","https://openalex.org/W2804770727"],"abstract_inverted_index":{"We":[0],"give":[1,25],"O(\u221alog":[2],"n)-approximation":[3,28,47],"algorithms":[4,24],"for":[5,29,48],"the":[6,56,64],"MIN":[7,9,30,49],"UNCUT,":[8],"2CNF":[10,50],"DELETION,":[11],"DIRECTED":[12,16,33,37],"BALANCED":[13,34],"SEPERATOR,":[14],"and":[15,41],"SPARSEST":[17,38],"CUT":[18,39],"problems.":[19],"The":[20],"previously":[21],"best":[22],"known":[23],"an":[26,42,60],"O(log":[27,43],"UNCUT":[31],"[9],":[32],"SEPERATOR":[35],"[17],":[36,40],"n":[44],"log":[45,46],"DELETION":[51],"[14].We":[52],"also":[53],"show":[54],"that":[55],"integrality":[57],"gap":[58],"of":[59,63],"SDP":[61],"relaxation":[62],"MINIMUM":[65],"MULTICUT":[66],"problem":[67],"is":[68],"\u03a9(log":[69],"n).":[70]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":3},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":4},{"year":2019,"cited_by_count":8},{"year":2018,"cited_by_count":8},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":8},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":11},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":12}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}