{"id":"https://openalex.org/W2009924457","doi":"https://doi.org/10.1145/1250790.1250888","title":"Improved approximation for directed cut problems","display_name":"Improved approximation for directed cut problems","publication_year":2007,"publication_date":"2007-06-11","ids":{"openalex":"https://openalex.org/W2009924457","doi":"https://doi.org/10.1145/1250790.1250888","mag":"2009924457"},"language":"en","primary_location":{"id":"doi:10.1145/1250790.1250888","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250888","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-ninth 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/A5083469386","display_name":"Noga Alon","orcid":"https://orcid.org/0000-0003-1332-4883"},"institutions":[{"id":"https://openalex.org/I16391192","display_name":"Tel Aviv University","ror":"https://ror.org/04mhzgx49","country_code":"IL","type":"education","lineage":["https://openalex.org/I16391192"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Noga Alon","raw_affiliation_strings":["Tel Aviv University, Tel Aviv, Israel","Tel Aviv University, Tel Aviv, Israel,"],"affiliations":[{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel","institution_ids":["https://openalex.org/I16391192"]},{"raw_affiliation_string":"Tel Aviv University, Tel Aviv, Israel,","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"last","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 S. Charikar","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":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5074110882"],"corresponding_institution_ids":["https://openalex.org/I20089843"],"apc_list":null,"apc_paid":null,"fwci":4.8564,"has_fulltext":false,"cited_by_count":68,"citation_normalized_percentile":{"value":0.9490594,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"671","last_page":"680"},"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.9998000264167786,"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.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9966999888420105,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9891999959945679,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/maximum-cut","display_name":"Maximum cut","score":0.7028916478157043},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6911715269088745},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5509113073348999},{"id":"https://openalex.org/keywords/linear-programming-relaxation","display_name":"Linear programming relaxation","score":0.522699236869812},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5200619101524353},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5031442046165466},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.4934598505496979},{"id":"https://openalex.org/keywords/relaxation","display_name":"Relaxation (psychology)","score":0.4684602916240692},{"id":"https://openalex.org/keywords/scheme","display_name":"Scheme (mathematics)","score":0.4226554334163666},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41067296266555786},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.34512490034103394},{"id":"https://openalex.org/keywords/linear-programming","display_name":"Linear programming","score":0.24385622143745422},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.10364851355552673},{"id":"https://openalex.org/keywords/mathematical-analysis","display_name":"Mathematical analysis","score":0.07335945963859558},{"id":"https://openalex.org/keywords/medicine","display_name":"Medicine","score":0.07318845391273499}],"concepts":[{"id":"https://openalex.org/C165526019","wikidata":"https://www.wikidata.org/wiki/Q942557","display_name":"Maximum cut","level":3,"score":0.7028916478157043},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6911715269088745},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5509113073348999},{"id":"https://openalex.org/C25360446","wikidata":"https://www.wikidata.org/wiki/Q1512771","display_name":"Linear programming relaxation","level":3,"score":0.522699236869812},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5200619101524353},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5031442046165466},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4934598505496979},{"id":"https://openalex.org/C2776029896","wikidata":"https://www.wikidata.org/wiki/Q3935810","display_name":"Relaxation (psychology)","level":2,"score":0.4684602916240692},{"id":"https://openalex.org/C77618280","wikidata":"https://www.wikidata.org/wiki/Q1155772","display_name":"Scheme (mathematics)","level":2,"score":0.4226554334163666},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41067296266555786},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.34512490034103394},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.24385622143745422},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.10364851355552673},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.07335945963859558},{"id":"https://openalex.org/C71924100","wikidata":"https://www.wikidata.org/wiki/Q11190","display_name":"Medicine","level":0,"score":0.07318845391273499},{"id":"https://openalex.org/C126322002","wikidata":"https://www.wikidata.org/wiki/Q11180","display_name":"Internal medicine","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1145/1250790.1250888","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1250790.1250888","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-ninth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.108.4402","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.108.4402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.math.tau.ac.il/~nogaa/PDFS/aac.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.363.9139","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.363.9139","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~moses/papers/multicut.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1523006294","https://openalex.org/W1979703213","https://openalex.org/W1986291656","https://openalex.org/W1990313671","https://openalex.org/W1996965889","https://openalex.org/W2008362572","https://openalex.org/W2020632401","https://openalex.org/W2045675568","https://openalex.org/W2070434785","https://openalex.org/W2078714635","https://openalex.org/W2125278290","https://openalex.org/W2127114399","https://openalex.org/W2133017912","https://openalex.org/W2141353198","https://openalex.org/W2153164535","https://openalex.org/W2614099084","https://openalex.org/W4210546998","https://openalex.org/W6980659882"],"related_works":["https://openalex.org/W2185409389","https://openalex.org/W2593080689","https://openalex.org/W2141353198","https://openalex.org/W1991979416","https://openalex.org/W2254726702","https://openalex.org/W2395976569","https://openalex.org/W276709744","https://openalex.org/W1966079129","https://openalex.org/W2117839333","https://openalex.org/W4234897719"],"abstract_inverted_index":{"We":[0,21,36],"present":[1],"improved":[2],"approximation":[3],"algorithms":[4],"for":[5,16],"directed":[6,8,70],"multicutand":[7],"sparsest":[9],"cut.":[10],"The":[11],"current":[12],"best":[13],"known":[14],"approximationratio":[15],"these":[17],"problems":[18],"is":[19],"O(n1/2).":[20],"obtain":[22],"an":[23],"\u00d5(n11/23)-approximation.":[24],"Our":[25],"algorithm":[26],"works":[27],"with":[28,41],"thenatural":[29],"LP":[30],"relaxation":[31],"used":[32],"in":[33,69],"prior":[34],"work.":[35],"use":[37],"a":[38,42,55],"randomized":[39],"roundingalgorithm":[40],"more":[43],"sophisticated":[44],"charging":[45],"scheme":[46],"and":[47],"analysis":[48],"toobtain":[49],"our":[50],"improvement.":[51],"This":[52],"also":[53],"implies":[54],"\u00d5(n11/23)":[56],"upper":[57],"bound":[58],"on":[59],"the":[60,63],"ratio":[61],"between":[62],"maximum":[64],"multicommodity":[65],"flowand":[66],"minimum":[67],"multicut":[68],"graphs.":[71]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2022,"cited_by_count":2},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":10},{"year":2018,"cited_by_count":7},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":5},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":7},{"year":2012,"cited_by_count":7}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}