{"id":"https://openalex.org/W2107396513","doi":"https://doi.org/10.1145/2213977.2214040","title":"Approximation algorithms and hardness of integral concurrent flow","display_name":"Approximation algorithms and hardness of integral concurrent flow","publication_year":2012,"publication_date":"2012-05-19","ids":{"openalex":"https://openalex.org/W2107396513","doi":"https://doi.org/10.1145/2213977.2214040","mag":"2107396513"},"language":"en","primary_location":{"id":"doi:10.1145/2213977.2214040","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214040","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-fourth 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/A5016828567","display_name":"Parinya Chalermsook","orcid":"https://orcid.org/0009-0000-2833-0472"},"institutions":[{"id":"https://openalex.org/I40347166","display_name":"University of Chicago","ror":"https://ror.org/024mw5h28","country_code":"US","type":"education","lineage":["https://openalex.org/I40347166"]},{"id":"https://openalex.org/I39422238","display_name":"University of Illinois Chicago","ror":"https://ror.org/02mpq6x41","country_code":"US","type":"education","lineage":["https://openalex.org/I39422238"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Parinya Chalermsook","raw_affiliation_strings":["University of Chicago, Chicago, IL, USA","University of Chicago , Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"University of Chicago, Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166","https://openalex.org/I39422238"]},{"raw_affiliation_string":"University of Chicago , Chicago, IL, USA","institution_ids":["https://openalex.org/I40347166"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056023203","display_name":"Julia Chuzhoy","orcid":"https://orcid.org/0000-0001-7839-751X"},"institutions":[{"id":"https://openalex.org/I160992636","display_name":"Toyota Technological Institute at Chicago","ror":"https://ror.org/02sn5gb64","country_code":"US","type":"education","lineage":["https://openalex.org/I160992636"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Julia Chuzhoy","raw_affiliation_strings":["Toyota Technological Institute, Chicago, IL, USA"],"affiliations":[{"raw_affiliation_string":"Toyota Technological Institute, Chicago, IL, USA","institution_ids":["https://openalex.org/I160992636"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5025907388","display_name":"Alina Ene","orcid":"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,"raw_author_name":"Alina Ene","raw_affiliation_strings":["University of Illinois at Urbana Champaign, Urbana, IL, USA","University of Illinois at Urbana/Champaign, Urbana, IL, USA#TAB#"],"affiliations":[{"raw_affiliation_string":"University of Illinois at Urbana Champaign, Urbana, IL, USA","institution_ids":["https://openalex.org/I157725225"]},{"raw_affiliation_string":"University of Illinois at Urbana/Champaign, Urbana, IL, USA#TAB#","institution_ids":["https://openalex.org/I157725225"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100610530","display_name":"Shi Li","orcid":"https://orcid.org/0000-0002-2982-4332"},"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":"Shi Li","raw_affiliation_strings":["Princeton University, Princeton, NJ, USA","Princeton University , Princeton, NJ, USA"],"affiliations":[{"raw_affiliation_string":"Princeton University, Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]},{"raw_affiliation_string":"Princeton University , Princeton, NJ, USA","institution_ids":["https://openalex.org/I20089843"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5016828567"],"corresponding_institution_ids":["https://openalex.org/I39422238","https://openalex.org/I40347166"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.15629732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"689","last_page":"708"},"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.9998999834060669,"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.9998999834060669,"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.9988999962806702,"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/T10237","display_name":"Cryptography and Data Security","score":0.9975000023841858,"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/vertex","display_name":"Vertex (graph theory)","score":0.722624659538269},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.6921244263648987},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.5872470140457153},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5494080781936646},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.5358273983001709},{"id":"https://openalex.org/keywords/binary-logarithm","display_name":"Binary logarithm","score":0.5189613699913025},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.5036823153495789},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.4954336881637573},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.4542182385921478},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.437730073928833},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.41866904497146606},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.38364964723587036},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.2369198203086853}],"concepts":[{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.722624659538269},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.6921244263648987},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.5872470140457153},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5494080781936646},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5358273983001709},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.5189613699913025},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.5036823153495789},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.4954336881637573},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.4542182385921478},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.437730073928833},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.41866904497146606},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.38364964723587036},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.2369198203086853},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0},{"id":"https://openalex.org/C104317684","wikidata":"https://www.wikidata.org/wiki/Q7187","display_name":"Gene","level":2,"score":0.0},{"id":"https://openalex.org/C55493867","wikidata":"https://www.wikidata.org/wiki/Q7094","display_name":"Biochemistry","level":1,"score":0.0},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1145/2213977.2214040","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2213977.2214040","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-fourth annual ACM symposium on Theory of computing","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.226.4592","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.226.4592","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/%7Eshili/papers/ICF-STOC.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.300.3361","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.300.3361","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/~shili/papers/ICF-extabs.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.385.7782","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.385.7782","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://ttic.uchicago.edu/~cjulia/papers/ICF.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":34,"referenced_works":["https://openalex.org/W156176439","https://openalex.org/W1563039933","https://openalex.org/W1593787329","https://openalex.org/W1964510837","https://openalex.org/W1964520854","https://openalex.org/W1967762975","https://openalex.org/W1970259241","https://openalex.org/W1971680255","https://openalex.org/W1975442866","https://openalex.org/W1978207220","https://openalex.org/W1989234747","https://openalex.org/W1999867351","https://openalex.org/W2011334641","https://openalex.org/W2019041817","https://openalex.org/W2019578639","https://openalex.org/W2022191808","https://openalex.org/W2044343300","https://openalex.org/W2068115726","https://openalex.org/W2069159763","https://openalex.org/W2072870176","https://openalex.org/W2088844265","https://openalex.org/W2107881198","https://openalex.org/W2109693504","https://openalex.org/W2119862441","https://openalex.org/W2122997342","https://openalex.org/W2140262267","https://openalex.org/W2141793995","https://openalex.org/W2145818650","https://openalex.org/W2148352980","https://openalex.org/W2150148016","https://openalex.org/W2150516767","https://openalex.org/W2168919539","https://openalex.org/W2401610261","https://openalex.org/W3149604617"],"related_works":["https://openalex.org/W2147954430","https://openalex.org/W1906268133","https://openalex.org/W2963158951","https://openalex.org/W1995738188","https://openalex.org/W4235911878","https://openalex.org/W2070751425","https://openalex.org/W2031552172","https://openalex.org/W2622090745","https://openalex.org/W1637162813","https://openalex.org/W2583782779"],"abstract_inverted_index":{"We":[0,102,124,161,243],"study":[1,165],"an":[2,30,104,281],"integral":[3],"counterpart":[4],"of":[5,23,42,54,70,77,92,171,183,185,214,231,236],"the":[6,20,55,90,116,166,172,229,234,240,267,276,301],"classical":[7],"Maximum":[8],"Concurrent":[9,16],"Flow":[10,17],"problem,":[11,268],"that":[12,73,106,130,217,245,285,300],"we":[13,27,177,279,297],"call":[14],"Integral":[15],"(ICF).":[18],"In":[19],"basic":[21],"version":[22,170],"this":[24,126],"problem":[25,173],"(basic-ICF),":[26],"are":[28,178,298],"given":[29,179],"undirected":[31],"n-vertex":[32],"graph":[33],"$G$":[34],"with":[35,139,263,292],"edge":[36,96,117,241],"capacities":[37,118],"c(e),":[38],"a":[39,47,62,67,108,121,136,180,196,206,211,260,287,293],"subset":[40],"T":[41],"vertices":[43,230,235],"called":[44],"terminals,":[45],"and":[46,66,89,188,210],"demand":[48,197],"D(t,t')":[49],"for":[50,112,142,189,218,246,266],"every":[51,74,315],"pair":[52,75,316],"(t,t')":[53,76],"terminals.":[56],"The":[57,201],"goal":[58,202],"is":[59,79,98,199,203],"to":[60,164,204,233],"find":[61,205],"maximum":[63,207],"value":[64,208],"\u03bb,":[65],"collection":[68,181,212],"P":[69,213],"paths,":[71,215],"such":[72,216],"terminals":[78],"connected":[80],"by":[81,119,128],"\u230a":[82,223],"\u03bb":[83,209,224],"\u22c5":[84,148,225],"D(t,t')\u230b":[85],"paths":[86,93,227,313],"in":[87,175],"P,":[88],"number":[91],"containing":[94],"any":[95,143,247],"e":[97],"at":[99,221,305],"most":[100],"c(e).":[101],"show":[103,244,280],"algorithm":[105,133,257,284],"achieves":[107],"poly":[109,288,310],"log":[110,150,152,153,159,253,273,289,311],"n-approximation":[111],"basic-ICF,":[113],"while":[114,238],"violating":[115],"only":[120],"constant":[122,294],"factor.":[123],"complement":[125],"result":[127],"proving":[129],"no":[131,255],"efficient":[132,256,282],"can":[134,258],"achieve":[135,259],"factor":[137,261],"\u03b1-approximation":[138],"congestion":[140,264],"c":[141,250,265],"values":[144],"\u03b1,c":[145],"satisfying":[146],"\u03b1":[147],"c=O(log":[149],"n/log":[151],"n),":[154,254],"unless":[155,269],"NP":[156,270],"\u2286":[157,271],"ZPTIME(npoly":[158],"n).":[160],"then":[162],"turn":[163],"more":[167],"general":[168],"group":[169],"(group=ICF),":[174],"which":[176],"(S1,T1),...,(Sk,Tk)}":[182],"pairs":[184],"vertex":[186],"subsets,":[187],"each":[190,219],"1":[191,248],"\u2264":[192,194,249,251],"i":[193],"k,":[195],"Di":[198],"specified.":[200],"i,":[220],"least":[222,306],"Di\u230b":[226],"connect":[228],"Si":[232],"Ti,":[237],"respecting":[239],"capacities.":[242],"O(log":[252],"O(n1/(22c+3))-approximation":[262],"DTIME(nO(log":[272],"n)).":[274],"On":[275],"other":[277],"hand,":[278],"randomized":[283],"finds":[286],"n-approximate":[290],"solution":[291,303],"congestion,":[295],"if":[296],"guaranteed":[299],"optimal":[302],"contains":[304],"D":[307],"\u2265":[308],"k":[309],"n":[312],"connecting":[314],"(Si,Ti).":[317]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}