{"id":"https://openalex.org/W2119003693","doi":"https://doi.org/10.1109/focs.2011.34","title":"Approximation Algorithms for Submodular Multiway Partition","display_name":"Approximation Algorithms for Submodular Multiway Partition","alternate_titles":[],"publication_year":2011,"publication_date":"2011-10-01","ids":{"openalex":"https://openalex.org/W2119003693","doi":"https://doi.org/10.1109/focs.2011.34","mag":"2119003693"},"language":"en","primary_location":{"id":"doi:10.1109/focs.2011.34","doi":"https://doi.org/10.1109/focs.2011.34","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2011.34","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE 52nd Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"},"parent_works":[],"lineage":["https://openalex.org/W2119003693"],"child_works_count":0,"type":"conference-paper","is_traditional":true,"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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699","observed_orcids":["https://orcid.org/0000-0003-3035-1699"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Chandra Chekuri","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana, IL, USA","Dept. of Computer Science, University of Illinois, Urbana, IL, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Illinois, Urbana, IL, USA#TAB#","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5025907388","display_name":"Alina Raluca Ene","orcid":"https://orcid.org/0000-0002-5818-1807","observed_orcids":["https://orcid.org/0000-0002-5818-1807"]},"institutions":[{"id":"https://openalex.org/I157725225","display_name":"University of Illinois Urbana-Champaign","ror":"https://ror.org/047426m28","country_code":"US","type":"education","lineage":["https://openalex.org/I157725225"]}],"countries":["US"],"is_corresponding":false,"contributor_roles":[],"raw_author_name":"Alina Ene","raw_affiliation_strings":["Department of Computer Science, University of Illinois, Urbana, IL, USA","Dept. of Computer Science, University of Illinois, Urbana, IL, USA#TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, University of Illinois, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"Dept. of Computer Science, University of Illinois, Urbana, IL, USA#TAB#","institution_ids":["https://openalex.org/I157725225"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I157725225"],"apc_list":null,"apc_paid":null,"fwci":3.476,"has_fulltext":false,"cited_by_count":65,"citation_normalized_percentile":{"value":0.93618794,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":92,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"807","last_page":"816"},"is_retracted":false,"is_pulled":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9984999895095825,"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.9984999895095825,"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.0005000000237487257,"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/T10991","display_name":"Game Theory and Voting Systems","score":9.999999747378752e-05,"subfield":{"id":"https://openalex.org/subfields/2002","display_name":"Economics and Econometrics"},"field":{"id":"https://openalex.org/fields/20","display_name":"Economics, Econometrics and Finance"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/approximation-algorithms","display_name":"approximation algorithms","score":0.8600000143051147},{"id":"https://openalex.org/keywords/submodularity","display_name":"submodular functions","score":0.8090000152587891},{"id":"https://openalex.org/keywords/multiway-cut","display_name":"multiway cut","score":0.843999981880188},{"id":"https://openalex.org/keywords/lovasz-extension","display_name":"Lov\u00e1sz extension","score":0.8130000233650208},{"id":"https://openalex.org/keywords/approximation-ratio","display_name":"approximation ratio","score":0.45100000500679016}],"concepts":[{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5067315697669983},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.4486534297466278},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42284882068634033},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3660460412502289},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.336273193359375},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2874258756637573}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/focs.2011.34","doi":"https://doi.org/10.1109/focs.2011.34","is_oa":false,"landing_page_url":"https://doi.org/10.1109/focs.2011.34","pdf_url":null,"source":{"id":"https://openalex.org/S4210175768","display_name":"Annual Symposium on Foundations of Computer Science","issn_l":"0272-5428","issn":["0272-5428"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2011 IEEE 52nd Annual Symposium on Foundations of Computer Science","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[{"id":"https://openalex.org/G1323834836","display_name":"AF:  Small:  Approximation Algorithms for Graph and Combinatorial Optimization Problems","funder_award_id":"1016684","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G2538000623","display_name":"Approximation Algorithms for Routing and Network Design","funder_award_id":"0728782","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":false,"pdf":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W123178497","https://openalex.org/W158604334","https://openalex.org/W1498671329","https://openalex.org/W1523006294","https://openalex.org/W1572332593","https://openalex.org/W1695878779","https://openalex.org/W1974657465","https://openalex.org/W1981202693","https://openalex.org/W1981351071","https://openalex.org/W1984283136","https://openalex.org/W1985219023","https://openalex.org/W1989453388","https://openalex.org/W2008475686","https://openalex.org/W2010004564","https://openalex.org/W2026838540","https://openalex.org/W2038938388","https://openalex.org/W2063597011","https://openalex.org/W2064933851","https://openalex.org/W2089729462","https://openalex.org/W2108321693","https://openalex.org/W2112306992","https://openalex.org/W2129866531","https://openalex.org/W2134944545","https://openalex.org/W2152986618","https://openalex.org/W2167236203","https://openalex.org/W2167637346","https://openalex.org/W3009415557","https://openalex.org/W4248079359"],"related_works":["https://openalex.org/W2026838540","https://openalex.org/W3037181640","https://openalex.org/W4411187984","https://openalex.org/W4405417635","https://openalex.org/W1695878779","https://openalex.org/W2063597011","https://openalex.org/W4304544053","https://openalex.org/W7098728054","https://openalex.org/W2056463115","https://openalex.org/W2064401168"],"abstract_inverted_index":{"We":[0],"study":[1],"algorithms":[2,117],"for":[3,66,98,137,151,163,173,188],"the":[4,81,90,141,160,177,196],"SUBMODULAR":[5],"Multiway":[6],"PARTITION":[7],"problem":[8,84,94],"(SUB-MP).":[9],"An":[10],"instance":[11],"of":[12,15,31,104,143],"SUB-MP":[13,74,97,138,189],"consists":[14],"a":[16,21,37,49,134,144],"finite":[17],"ground":[18],"set":[19,40],"V,":[20],"subset":[22],"S":[23],"=":[24],"{s1,":[25],"S2,":[26],"...,":[27],"sk}":[28],"\u2286":[29],"V":[30,46,57],"k":[32,59],"elements":[33],"called":[34],"terminals,":[35],"and":[36,87,89,113,123,125,147],"non-negative":[38],"submodular":[39,145,165],"function":[41,146],"f":[42,191],":":[43],"2V\u2192":[44],"\u211d+on":[45],"provided":[47],"as":[48,80],"value":[50],"oracle.":[51],"The":[52],"goal":[53],"is":[54,192],"to":[55],"partition":[56],"into":[58],"sets":[60],"A1,...,Akto":[61],"minimize":[62],"\u03a3i=1kf(Ai)":[63],"such":[64,79],"that":[65],"1":[67],"\u2264":[68,70],"i":[69],"k,":[71],"si\u2208":[72],"Ai.":[73],"generalizes":[75],"some":[76,152],"well-known":[77],"problems":[78],"MULTIWAY":[82,92],"CUT":[83],"in":[85,95],"graphs":[86],"hypergraphs,":[88],"NODE-WEIGHED":[91],"Cut":[93],"graphs.":[96],"arbitrary":[99,164],"sub-":[100],"modular":[101],"functions":[102,166],"(instead":[103],"just":[105],"symmetric":[106],"functions)":[107],"was":[108],"considered":[109],"by":[110],"Zhao,":[111],"Nagamochi":[112],"Ibaraki":[114],"[29].":[115,182,202],"Previous":[116],"were":[118],"based":[119,139],"on":[120,140],"greedy":[121],"splitting":[122],"divide":[124],"conquer":[126],"strategies.":[127],"In":[128,155],"recent":[129],"work":[130],"[5]":[131],"we":[132,158],"proposed":[133],"convex-programming":[135],"relaxation":[136],"Lovasz-extension":[142],"showed":[148],"its":[149],"applicability":[150],"special":[153],"cases.":[154],"this":[156,168],"paper":[157],"obtain":[159],"following":[161],"results":[162],"via":[167],"relaxation.":[169],"(1)":[170],"A":[171,184],"2-approximation":[172],"SUB-MP.":[174],"This":[175,194],"improves":[176,195],"(k":[178],"-":[179,186,198],"1)-approximation":[180],"from":[181,200],"(2)":[183],"(1.5":[185],"1/k)-approximation":[187,199],"when":[190],"symmetric.":[193],"2(1":[197],"[23],":[201]},"cited_by_api_url":"https://api.openalex.org/works?filter=cites:W2119003693","counts_by_year":[{"year":2026,"cited_by_count":3},{"year":2025,"cited_by_count":3},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":3},{"year":2020,"cited_by_count":6},{"year":2019,"cited_by_count":4},{"year":2018,"cited_by_count":5},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":5},{"year":2013,"cited_by_count":8},{"year":2012,"cited_by_count":2}],"updated_date":"2026-11-21T10:27:49.728292","created_date":"2016-06-24T00:00:00"}
