{"id":"https://openalex.org/W2466928157","doi":"https://doi.org/10.1007/s11235-016-0190-2","title":"A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees","display_name":"A randomized rounding approach to a k-splittable multicommodity flow problem with lower path flow bounds affording solution quality guarantees","publication_year":2016,"publication_date":"2016-06-23","ids":{"openalex":"https://openalex.org/W2466928157","doi":"https://doi.org/10.1007/s11235-016-0190-2","mag":"2466928157"},"language":"en","primary_location":{"id":"doi:10.1007/s11235-016-0190-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11235-016-0190-2","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs11235-016-0190-2.pdf","source":{"id":"https://openalex.org/S145894672","display_name":"Telecommunication Systems","issn_l":"1018-4864","issn":["1018-4864","1572-9451"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Telecommunication Systems","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2Fs11235-016-0190-2.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5013770955","display_name":"Pawe\u0142 Bia\u0142o\u0144","orcid":null},"institutions":[{"id":"https://openalex.org/I4210125529","display_name":"National Institute of Telecommunications","ror":"https://ror.org/03053v606","country_code":"PL","type":"facility","lineage":["https://openalex.org/I4210125529"]}],"countries":["PL"],"is_corresponding":true,"raw_author_name":"Pawe\u0142 M. Bia\u0142o\u0144","raw_affiliation_strings":["National Institute of Telecommunications, Szachowa Str. 1, 04-894, Warsaw, Poland"],"affiliations":[{"raw_affiliation_string":"National Institute of Telecommunications, Szachowa Str. 1, 04-894, Warsaw, Poland","institution_ids":["https://openalex.org/I4210125529"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5013770955"],"corresponding_institution_ids":["https://openalex.org/I4210125529"],"apc_list":{"value":2190,"currency":"EUR","value_usd":2790},"apc_paid":{"value":2190,"currency":"EUR","value_usd":2790},"fwci":1.0782,"has_fulltext":true,"cited_by_count":16,"citation_normalized_percentile":{"value":0.80063941,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"64","issue":"3","first_page":"525","last_page":"542"},"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.9983000159263611,"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.9983000159263611,"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/T12176","display_name":"Optimization and Packing Problems","score":0.9878000020980835,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.8139418959617615},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.6869515180587769},{"id":"https://openalex.org/keywords/flow","display_name":"Flow (mathematics)","score":0.6513793468475342},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.641659677028656},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.6392479538917542},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.56858891248703},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5325666069984436},{"id":"https://openalex.org/keywords/integer","display_name":"Integer (computer science)","score":0.44804322719573975},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4249935746192932},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.4062657952308655},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3956391513347626},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.38650134205818176},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.3777240216732025},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3643116354942322}],"concepts":[{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.8139418959617615},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.6869515180587769},{"id":"https://openalex.org/C38349280","wikidata":"https://www.wikidata.org/wiki/Q1434290","display_name":"Flow (mathematics)","level":2,"score":0.6513793468475342},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.641659677028656},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.6392479538917542},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.56858891248703},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5325666069984436},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.44804322719573975},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4249935746192932},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.4062657952308655},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3956391513347626},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.38650134205818176},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.3777240216732025},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3643116354942322},{"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/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","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}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1007/s11235-016-0190-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11235-016-0190-2","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs11235-016-0190-2.pdf","source":{"id":"https://openalex.org/S145894672","display_name":"Telecommunication Systems","issn_l":"1018-4864","issn":["1018-4864","1572-9451"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Telecommunication Systems","raw_type":"journal-article"},{"id":"pmh:oai:RePEc:spr:telsys:v:64:y:2017:i:3:d:10.1007_s11235-016-0190-2","is_oa":false,"landing_page_url":"http://link.springer.com/10.1007/s11235-016-0190-2","pdf_url":null,"source":{"id":"https://openalex.org/S4306401271","display_name":"RePEc: Research Papers in Economics","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I77793887","host_organization_name":"Federal Reserve Bank of St. Louis","host_organization_lineage":["https://openalex.org/I77793887"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.1007/s11235-016-0190-2","is_oa":true,"landing_page_url":"https://doi.org/10.1007/s11235-016-0190-2","pdf_url":"https://link.springer.com/content/pdf/10.1007%2Fs11235-016-0190-2.pdf","source":{"id":"https://openalex.org/S145894672","display_name":"Telecommunication Systems","issn_l":"1018-4864","issn":["1018-4864","1572-9451"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"journal"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Telecommunication Systems","raw_type":"journal-article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth","score":0.41999998688697815}],"awards":[{"id":"https://openalex.org/G3848063861","display_name":null,"funder_award_id":"2007-2013","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"},{"id":"https://openalex.org/G6247543969","display_name":null,"funder_award_id":"POIG.02.03.01-104/13-00","funder_id":"https://openalex.org/F4320335322","funder_display_name":"European Regional Development Fund"}],"funders":[{"id":"https://openalex.org/F4320335322","display_name":"European Regional Development Fund","ror":"https://ror.org/00k4n6c32"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W2466928157.pdf","grobid_xml":"https://content.openalex.org/works/W2466928157.grobid-xml"},"referenced_works_count":28,"referenced_works":["https://openalex.org/W1494160116","https://openalex.org/W1508306565","https://openalex.org/W1515075899","https://openalex.org/W1552561242","https://openalex.org/W1591562949","https://openalex.org/W1600205816","https://openalex.org/W1966258309","https://openalex.org/W1985682371","https://openalex.org/W2021136283","https://openalex.org/W2022191808","https://openalex.org/W2022527378","https://openalex.org/W2040481750","https://openalex.org/W2084625567","https://openalex.org/W2086260323","https://openalex.org/W2087284990","https://openalex.org/W2091480483","https://openalex.org/W2147118406","https://openalex.org/W2497618040","https://openalex.org/W2620799147","https://openalex.org/W2725407974","https://openalex.org/W2735337572","https://openalex.org/W2752573522","https://openalex.org/W2752885492","https://openalex.org/W3145128584","https://openalex.org/W4236242332","https://openalex.org/W6633211032","https://openalex.org/W6835982072","https://openalex.org/W7029321148"],"related_works":["https://openalex.org/W1581948717","https://openalex.org/W2268207117","https://openalex.org/W4300488607","https://openalex.org/W2951095575","https://openalex.org/W2105543801","https://openalex.org/W1530375092","https://openalex.org/W1916943706","https://openalex.org/W2002272911","https://openalex.org/W2561769964","https://openalex.org/W1739960723"],"abstract_inverted_index":{"In":[0],"2005,":[1],"Baier":[2,119],"et":[3,120],"al.":[4],"introduced":[5],"a":[6,17,25,31,37,60,67,74,85,89,96,100,124,194],"\u201ck-splittable\u201d":[7],"variant":[8],"of":[9,27,40,63,76,107,180,209,224],"the":[10,41,45,54,104,109,112,132,147,162,173,198,207,217,222,225],"multicommodity":[11],"flow":[12,23,91,114,149],"(MCF)":[13],"problem":[14,35,50,71,110],"in":[15,92,161,183],"which":[16],"given":[18],"commodity":[19],"was":[20],"allowed":[21],"to":[22,94,111,142,165,192,197],"through":[24],"number":[26,62,208],"paths":[28],"limited":[29],"by":[30,118,176],"small":[32],"integer.":[33],"This":[34],"enables":[36],"better":[38],"use":[39],"link":[42],"capacities":[43],"than":[44],"classical":[46],"Kleinberg\u2019s":[47],"unsplittable":[48,113],"MCF":[49,70,140],"while":[51],"not":[52],"overloading":[53],"used":[55],"devices":[56],"and":[57,134,146,220],"protocols":[58],"with":[59],"large":[61],"paths.":[64],"We":[65,83,129,212],"solve":[66],"minimum-congestion":[68],"k-splittable":[69],"coming":[72],"from":[73],"practice":[75],"managing":[77],"an":[78],"software-defined,":[79],"circuit":[80],"switching":[81],"network.":[82],"introduce":[84],"lower":[86,148],"bound":[87],"for":[88,99,138,144,216],"path":[90],"order":[93],"model":[95],"QoS":[97],"demand":[98],"single":[101],"connection":[102],"running":[103],"path.":[105],"Instead":[106],"reducing":[108],"problem,":[115],"as":[116],"suggested":[117],"al.,":[121],"we":[122],"propose":[123],"potentially":[125],"more":[126],"exact":[127],"method.":[128],"directly":[130],"enhance":[131],"Raghavan":[133],"Thompson\u2019s":[135],"randomized":[136],"rounding":[137,157],"ordinary":[139],"problems":[141],"account":[143],"k-splittability":[145],"bounds.":[150],"A":[151],"mechanism":[152],"is":[153,169],"constructed":[154],"that":[155],"prevents":[156],"up":[158],"low":[159],"flows":[160,179],"subproblem":[163,175],"solution":[164,218],"big":[166],"values.":[167],"It":[168],"based":[170],"on":[171],"modifying":[172],"continuous":[174],"additionally":[177],"penalizing":[178],"certain":[181,184],"commodities":[182],"links.":[185,211],"When":[186],"$$k=1$$":[187],",":[188],"this":[189],"allows":[190],"us":[191],"prove":[193],"property":[195],"similar":[196],"$$\\mathcal":[199],"O(\\sqrt{\\log":[200],"m})$$":[201],"approximation":[202],"factor,":[203],"where":[204],"m":[205],"denotes":[206],"network":[210],"give":[213],"probabilistic":[214],"guarantees":[215],"quality":[219],"examine":[221],"behavior":[223],"method":[226],"experimentally.":[227]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":5},{"year":2022,"cited_by_count":3},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2025-10-10T00:00:00"}