{"id":"https://openalex.org/W2949453383","doi":"https://doi.org/10.1137/1.9781611973075.34","title":"Region growing for multi-route cuts","display_name":"Region growing for multi-route cuts","publication_year":2010,"publication_date":"2010-01-17","ids":{"openalex":"https://openalex.org/W2949453383","doi":"https://doi.org/10.1137/1.9781611973075.34","mag":"2949453383"},"language":"en","primary_location":{"id":"doi:10.1137/1.9781611973075.34","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973075.34","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"proceedings-article"},"type":"preprint","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/A5039018238","display_name":"Siddharth Barman","orcid":"https://orcid.org/0000-0001-9276-2181"},"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":false,"raw_author_name":"Siddharth Barman","raw_affiliation_strings":["University of Wisconsin-Madison, #TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, #TAB#","institution_ids":["https://openalex.org/I135310074"]}]},{"author_position":"last","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":false,"raw_author_name":"Shuchi Chawla","raw_affiliation_strings":["University of Wisconsin-Madison, #TAB#"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Wisconsin-Madison, #TAB#","institution_ids":["https://openalex.org/I135310074"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.3435,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.67716768,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"404","last_page":"418"},"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.9819999933242798,"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.9819999933242798,"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/T10780","display_name":"Reliability and Maintenance Optimization","score":0.9624000191688538,"subfield":{"id":"https://openalex.org/subfields/2213","display_name":"Safety, Risk, Reliability and Quality"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10374","display_name":"Advanced Graph Theory Research","score":0.9527000188827515,"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/disjoint-sets","display_name":"Disjoint sets","score":0.749962568283081},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6216483116149902},{"id":"https://openalex.org/keywords/context","display_name":"Context (archaeology)","score":0.5318614840507507},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.5023412704467773},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4921702742576599},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.476727157831192},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.4314000606536865},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4160100817680359},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.41058987379074097},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.38443541526794434},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3803316056728363},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.32399117946624756},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.30356544256210327}],"concepts":[{"id":"https://openalex.org/C45340560","wikidata":"https://www.wikidata.org/wiki/Q215382","display_name":"Disjoint sets","level":2,"score":0.749962568283081},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6216483116149902},{"id":"https://openalex.org/C2779343474","wikidata":"https://www.wikidata.org/wiki/Q3109175","display_name":"Context (archaeology)","level":2,"score":0.5318614840507507},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.5023412704467773},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4921702742576599},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.476727157831192},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.4314000606536865},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4160100817680359},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41058987379074097},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.38443541526794434},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3803316056728363},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.32399117946624756},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.30356544256210327},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C151730666","wikidata":"https://www.wikidata.org/wiki/Q7205","display_name":"Paleontology","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},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/1.9781611973075.34","is_oa":false,"landing_page_url":"https://doi.org/10.1137/1.9781611973075.34","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms","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":3,"referenced_works":["https://openalex.org/W1519184063","https://openalex.org/W1965641578","https://openalex.org/W2013965337"],"related_works":["https://openalex.org/W4256429076","https://openalex.org/W1971174658","https://openalex.org/W2099195351","https://openalex.org/W2348092930","https://openalex.org/W2012063272","https://openalex.org/W3129272755","https://openalex.org/W2138685729","https://openalex.org/W26693340","https://openalex.org/W1963777171","https://openalex.org/W2132864204"],"abstract_inverted_index":{"We":[0,99,186],"study":[1],"a":[2,9,29,106,188],"number":[3,107,189],"of":[4,22,33,39,61,70,108,110,124,130,190],"multi-route":[5,141],"cut":[6,73],"problems:":[7],"given":[8,53],"graph":[10],"G":[11],"=":[12],"(V,":[13],"E)":[14],"and":[15,117,181],"connectivity":[16,43,95,119,145,167],"thresholds":[17,77,146,163,168,180],"k(u,":[18],"v)":[19,48],"on":[20],"pairs":[21],"nodes,":[23],"the":[24,37,42,59,76,86,94,97,101,111,131,140,144,162,179,184],"goal":[25],"is":[26,127],"to":[27,49,83,105,139,172],"find":[28],"minimum":[30,72,137],"cost":[31],"set":[32],"edges":[34],"or":[35,88,150],"vertices":[36],"removal":[38],"which":[40],"reduces":[41],"between":[44],"every":[45],"pair":[46],"(u,":[47],"strictly":[50],"below":[51],"its":[52],"threshold.":[54],"These":[55],"problems":[56,74],"arise":[57],"in":[58,63],"context":[60],"reliability":[62],"communication":[64],"networks;":[65],"They":[66],"are":[67,78,147],"natural":[68],"generalizations":[69],"traditional":[71],"where":[75,175],"either":[79,148],"1":[80],"(we":[81,90],"want":[82],"completely":[84],"separate":[85],"pair)":[87],"\u221e":[89,151],"don't":[91],"care":[92],"about":[93],"for":[96,114,135],"pair).":[98],"provide":[100],"first":[102],"non-trivial":[103],"approximations":[104,159,174],"variants":[109],"problem":[112],"including":[113],"both":[115],"node-disjoint":[116],"edge-disjoint":[118],"thresholds.":[120],"A":[121],"main":[122],"contribution":[123],"our":[125],"work":[126],"an":[128],"extension":[129],"region":[132],"growing":[133],"technique":[134],"approximating":[136],"multicuts":[138],"setting.":[142],"When":[143],"2":[149],"(the":[152],"\u201c2-route":[153],"cut\u201d":[154],"case),":[155],"we":[156,176],"obtain":[157],"polylogarithmic":[158],"while":[160],"satisfying":[161],"exactly.":[164],"For":[165],"arbitrary":[166],"this":[169],"approach":[170],"leads":[171],"bicriteria":[173],"approximately":[177,182],"satisfy":[178],"minimize":[183],"cost.":[185],"present":[187],"different":[191,194],"algorithms":[192],"achieving":[193],"cost-connectivity":[195],"tradeoffs.":[196]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2014,"cited_by_count":1},{"year":2012,"cited_by_count":1}],"updated_date":"2026-06-11T09:08:48.828518","created_date":"2025-10-10T00:00:00"}