{"id":"https://openalex.org/W2068289888","doi":"https://doi.org/10.1109/infcom.2012.6195830","title":"How to split a flow?","display_name":"How to split a flow?","publication_year":2012,"publication_date":"2012-03-01","ids":{"openalex":"https://openalex.org/W2068289888","doi":"https://doi.org/10.1109/infcom.2012.6195830","mag":"2068289888"},"language":"ru","primary_location":{"id":"doi:10.1109/infcom.2012.6195830","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195830","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Proceedings IEEE INFOCOM","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/A5041881415","display_name":"Tzvika Hartman","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117425","display_name":"Google (Israel)","ror":"https://ror.org/02c20ys54","country_code":"IL","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210117425","https://openalex.org/I4210128969"]}],"countries":["IL"],"is_corresponding":true,"raw_author_name":"Tzvika Hartman","raw_affiliation_strings":["Israel Research and Development Center, Google, Inc., Israel"],"affiliations":[{"raw_affiliation_string":"Israel Research and Development Center, Google, Inc., Israel","institution_ids":["https://openalex.org/I4210117425"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089579452","display_name":"Avinatan Hassidim","orcid":"https://orcid.org/0000-0002-3855-344X"},"institutions":[{"id":"https://openalex.org/I4210117425","display_name":"Google (Israel)","ror":"https://ror.org/02c20ys54","country_code":"IL","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210117425","https://openalex.org/I4210128969"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Avinatan Hassidim","raw_affiliation_strings":["Israel Research and Development Center, Google, Inc., Israel"],"affiliations":[{"raw_affiliation_string":"Israel Research and Development Center, Google, Inc., Israel","institution_ids":["https://openalex.org/I4210117425"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5006699796","display_name":"Haim Kaplan","orcid":"https://orcid.org/0000-0001-9586-8002"},"institutions":[{"id":"https://openalex.org/I4210117425","display_name":"Google (Israel)","ror":"https://ror.org/02c20ys54","country_code":"IL","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210117425","https://openalex.org/I4210128969"]},{"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":"Haim Kaplan","raw_affiliation_strings":["Israel Research and Development Center, Google, Inc., Israel","Tel Aviv University, Israel"],"affiliations":[{"raw_affiliation_string":"Israel Research and Development Center, Google, Inc., Israel","institution_ids":["https://openalex.org/I4210117425"]},{"raw_affiliation_string":"Tel Aviv University, Israel","institution_ids":["https://openalex.org/I16391192"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5105124259","display_name":"Danny Raz","orcid":null},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]},{"id":"https://openalex.org/I4210117425","display_name":"Google (Israel)","ror":"https://ror.org/02c20ys54","country_code":"IL","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210117425","https://openalex.org/I4210128969"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Danny Raz","raw_affiliation_strings":["Israel Research and Development Center, Google, Inc., Israel","Technion-Israel Institute of Technology, Israel"],"affiliations":[{"raw_affiliation_string":"Israel Research and Development Center, Google, Inc., Israel","institution_ids":["https://openalex.org/I4210117425"]},{"raw_affiliation_string":"Technion-Israel Institute of Technology, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5049812908","display_name":"Michal Segalov","orcid":null},"institutions":[{"id":"https://openalex.org/I4210117425","display_name":"Google (Israel)","ror":"https://ror.org/02c20ys54","country_code":"IL","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210117425","https://openalex.org/I4210128969"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Michal Segalov","raw_affiliation_strings":["Israel Research and Development Center, Google, Inc., Israel"],"affiliations":[{"raw_affiliation_string":"Israel Research and Development Center, Google, Inc., Israel","institution_ids":["https://openalex.org/I4210117425"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5041881415"],"corresponding_institution_ids":["https://openalex.org/I4210117425"],"apc_list":null,"apc_paid":null,"fwci":5.183,"has_fulltext":false,"cited_by_count":48,"citation_normalized_percentile":{"value":0.95828027,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"828","last_page":"836"},"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.9990000128746033,"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.9990000128746033,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9965000152587891,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.7446302175521851},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.6845544576644897},{"id":"https://openalex.org/keywords/fraction","display_name":"Fraction (chemistry)","score":0.6615990400314331},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6586192846298218},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6033481359481812},{"id":"https://openalex.org/keywords/decomposition","display_name":"Decomposition","score":0.567577600479126},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.529880166053772},{"id":"https://openalex.org/keywords/dependency","display_name":"Dependency (UML)","score":0.5037629008293152},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5012145042419434},{"id":"https://openalex.org/keywords/exponential-function","display_name":"Exponential function","score":0.4801635146141052},{"id":"https://openalex.org/keywords/greedy-algorithm","display_name":"Greedy algorithm","score":0.4640364646911621},{"id":"https://openalex.org/keywords/maximum-flow-problem","display_name":"Maximum flow problem","score":0.4514233469963074},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.4469548165798187},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.4455142319202423},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3904942274093628},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38993123173713684},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36170268058776855},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3547462821006775},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.12189772725105286}],"concepts":[{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.7446302175521851},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.6845544576644897},{"id":"https://openalex.org/C149629883","wikidata":"https://www.wikidata.org/wiki/Q660926","display_name":"Fraction (chemistry)","level":2,"score":0.6615990400314331},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6586192846298218},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6033481359481812},{"id":"https://openalex.org/C124681953","wikidata":"https://www.wikidata.org/wiki/Q339062","display_name":"Decomposition","level":2,"score":0.567577600479126},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.529880166053772},{"id":"https://openalex.org/C19768560","wikidata":"https://www.wikidata.org/wiki/Q320727","display_name":"Dependency (UML)","level":2,"score":0.5037629008293152},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5012145042419434},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.4801635146141052},{"id":"https://openalex.org/C51823790","wikidata":"https://www.wikidata.org/wiki/Q504353","display_name":"Greedy algorithm","level":2,"score":0.4640364646911621},{"id":"https://openalex.org/C157469704","wikidata":"https://www.wikidata.org/wiki/Q2585642","display_name":"Maximum flow problem","level":2,"score":0.4514233469963074},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.4469548165798187},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.4455142319202423},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3904942274093628},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38993123173713684},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36170268058776855},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3547462821006775},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.12189772725105286},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"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/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","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},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/infcom.2012.6195830","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infcom.2012.6195830","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 Proceedings IEEE INFOCOM","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.221.529","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.221.529","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://research.google.com/pubs/archive/37652.pdf","raw_type":"text"}],"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/W1516042705","https://openalex.org/W1531550827","https://openalex.org/W1988114663","https://openalex.org/W2012329067","https://openalex.org/W2029132631","https://openalex.org/W2033040247","https://openalex.org/W2100699015","https://openalex.org/W2130531694","https://openalex.org/W2147118406","https://openalex.org/W2153776688","https://openalex.org/W2164946254","https://openalex.org/W2169528473","https://openalex.org/W2348717821","https://openalex.org/W2399312309","https://openalex.org/W2725407974","https://openalex.org/W2735337572","https://openalex.org/W3031415405","https://openalex.org/W4238465620","https://openalex.org/W6630966411","https://openalex.org/W6682597455"],"related_works":["https://openalex.org/W3035974271","https://openalex.org/W3141113327","https://openalex.org/W2098682899","https://openalex.org/W4206915070","https://openalex.org/W3161514703","https://openalex.org/W1994440468","https://openalex.org/W2080904092","https://openalex.org/W2531764854","https://openalex.org/W2764325809","https://openalex.org/W2368069542"],"abstract_inverted_index":{"Many":[0],"practically":[1],"deployed":[2],"flow":[3,23,54,111,155,202,214],"algorithms":[4,119,178],"produce":[5,124],"the":[6,15,39,49,83,90,121,129,138,154,165,173,192,195,199,208,213,220,235,241,248],"output":[7],"as":[8,33],"a":[9,22,25,34,53,56,79,93,143,226,259],"set":[10,35],"of":[11,36,51,59,85,95,153,169,194,201,212],"values":[12],"associated":[13,106],"with":[14,108],"network":[16,26],"links.":[17],"However,":[18],"to":[19,30,77,229],"actually":[20],"deploy":[21],"in":[24,81],"we":[27,47,141],"often":[28],"need":[29],"represent":[31],"it":[32,74,223],"paths":[37,86],"between":[38],"source":[40],"and":[41,183],"destination":[42],"nodes.":[43],"In":[44],"this":[45,100],"paper":[46],"consider":[48],"problem":[50,122],"decomposing":[52],"into":[55,156],"small":[57],"number":[58,84,168],"paths.":[60,170],"We":[61,113,171],"show":[62,115],"that":[63,73,116,147,191,243],"there":[64],"is":[65,75,87,204],"some":[66],"fixed":[67],"constant":[68],"\u03b2":[69],">;":[70],"1":[71],"such":[72],"NP-hard":[76],"find":[78],"decomposition":[80,196],"which":[82,257],"larger":[88,126,268],"than":[89,128],"optimal":[91,130],"by":[92,176],"factor":[94],"at":[96,157],"most":[97,158,231],"\u03b2.":[98],"Furthermore,":[99],"holds":[101],"even":[102],"if":[103,219],"arcs":[104],"are":[105],"only":[107,266],"three":[109],"different":[110],"values.":[112],"also":[114,239],"straightforward":[117],"greedy":[118,249],"for":[120,245],"can":[123],"much":[125],"decompositions":[127,174],"one,":[131],"on":[132,179,184,198],"certain":[133],"well":[134],"tailored":[135],"inputs.":[136],"On":[137],"positive":[139],"side":[140],"present":[142],"new":[144],"approximation":[145],"algorithm":[146,256],"decomposes":[148],"all":[149,234],"but":[150,232],"an":[151],"c-fraction":[152],"O(1/\u03f5":[159],"<sup":[160],"xmlns:mml=\"http://www.w3.org/1998/Math/MathML\"":[161],"xmlns:xlink=\"http://www.w3.org/1999/xlink\">2</sup>":[162],")":[163],"times":[164],"smallest":[166],"possible":[167],"compare":[172],"produced":[175],"these":[177],"real":[180],"production":[181],"networks":[182],"synthetically":[185],"generated":[186],"data.":[187],"Our":[188],"results":[189],"indicate":[190],"dependency":[193],"size":[197],"fraction":[200],"covered":[203],"exponential.":[205],"Hence,":[206],"covering":[207],"last":[209],"few":[210],"percent":[211],"may":[215,224],"be":[216,225],"costly,":[217],"so":[218],"application":[221],"allows,":[222],"good":[227],"idea":[228],"decompose":[230],"not":[233],"flow.":[236],"The":[237],"experiments":[238],"reveal":[240],"fact":[242],"while":[244],"realistic":[246],"data":[247],"approach":[250],"works":[251],"very":[252],"well,":[253],"our":[254],"novel":[255],"has":[258],"provable":[260],"worst":[261],"case":[262],"guarantee,":[263],"typically":[264],"produces":[265],"slightly":[267],"decompositions.":[269]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2024,"cited_by_count":4},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":7},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":7},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":8},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":4}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}