{"id":"https://openalex.org/W2951032362","doi":"https://doi.org/10.1109/infocom.2019.8737402","title":"A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling","display_name":"A Constant Approximation for Maximum Throughput Multicommodity Routing And Its Application to Delay-Tolerant Network Scheduling","publication_year":2019,"publication_date":"2019-04-01","ids":{"openalex":"https://openalex.org/W2951032362","doi":"https://doi.org/10.1109/infocom.2019.8737402","mag":"2951032362"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2019.8737402","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","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/A5101829647","display_name":"Mengxue Liu","orcid":"https://orcid.org/0000-0002-2321-2669"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Mengxue Liu","raw_affiliation_strings":["Computer Science and Engineering, CIDSE, Arizona State University, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, CIDSE, Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5031875286","display_name":"Andr\u00e9a W. Richa","orcid":"https://orcid.org/0000-0003-3592-3756"},"institutions":[{"id":"https://openalex.org/I55732556","display_name":"Arizona State University","ror":"https://ror.org/03efmqc40","country_code":"US","type":"education","lineage":["https://openalex.org/I55732556"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Andrea W. Richa","raw_affiliation_strings":["Computer Science and Engineering, CIDSE, Arizona State University, USA"],"affiliations":[{"raw_affiliation_string":"Computer Science and Engineering, CIDSE, Arizona State University, USA","institution_ids":["https://openalex.org/I55732556"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5088898826","display_name":"Matthias Rost","orcid":"https://orcid.org/0000-0002-2380-0284"},"institutions":[{"id":"https://openalex.org/I4577782","display_name":"Technische Universit\u00e4t Berlin","ror":"https://ror.org/03v4gjf40","country_code":"DE","type":"education","lineage":["https://openalex.org/I4577782"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Matthias Rost","raw_affiliation_strings":["Department of Telecommunication Systems, TU Berlin, Germany"],"affiliations":[{"raw_affiliation_string":"Department of Telecommunication Systems, TU Berlin, Germany","institution_ids":["https://openalex.org/I4577782"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5066080641","display_name":"Stefan Schmid","orcid":"https://orcid.org/0000-0002-7798-1711"},"institutions":[{"id":"https://openalex.org/I129774422","display_name":"University of Vienna","ror":"https://ror.org/03prydq77","country_code":"AT","type":"education","lineage":["https://openalex.org/I129774422"]}],"countries":["AT"],"is_corresponding":false,"raw_author_name":"Stefan Schmid","raw_affiliation_strings":["Faculty of Computer Science, University of Vienna, Austria"],"affiliations":[{"raw_affiliation_string":"Faculty of Computer Science, University of Vienna, Austria","institution_ids":["https://openalex.org/I129774422"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5101829647"],"corresponding_institution_ids":["https://openalex.org/I55732556"],"apc_list":null,"apc_paid":null,"fwci":0.7074,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.72783412,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"46","last_page":"54"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998999834060669,"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"}},"topics":[{"id":"https://openalex.org/T11896","display_name":"Opportunistic and Delay-Tolerant Networks","score":0.9998999834060669,"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/T11478","display_name":"Caching and Content Delivery","score":0.9991999864578247,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9980000257492065,"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/computer-science","display_name":"Computer science","score":0.6188911199569702},{"id":"https://openalex.org/keywords/randomized-rounding","display_name":"Randomized rounding","score":0.6158475875854492},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.598195493221283},{"id":"https://openalex.org/keywords/rounding","display_name":"Rounding","score":0.5850275158882141},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5787104368209839},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5397546887397766},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5271498560905457},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5216631889343262},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5111892819404602},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.4869605004787445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.37087535858154297},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.21510976552963257},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.20160484313964844}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6188911199569702},{"id":"https://openalex.org/C32029473","wikidata":"https://www.wikidata.org/wiki/Q7292010","display_name":"Randomized rounding","level":3,"score":0.6158475875854492},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.598195493221283},{"id":"https://openalex.org/C136625980","wikidata":"https://www.wikidata.org/wiki/Q663208","display_name":"Rounding","level":2,"score":0.5850275158882141},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5787104368209839},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5397546887397766},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5271498560905457},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5216631889343262},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5111892819404602},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.4869605004787445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.37087535858154297},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.21510976552963257},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.20160484313964844},{"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/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C127716648","wikidata":"https://www.wikidata.org/wiki/Q104053","display_name":"Phenotype","level":3,"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/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C188082640","wikidata":"https://www.wikidata.org/wiki/Q1780899","display_name":"Complementation","level":4,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2019.8737402","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2019.8737402","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2019 - IEEE Conference on Computer Communications","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":29,"referenced_works":["https://openalex.org/W1595409123","https://openalex.org/W1979444789","https://openalex.org/W1989274820","https://openalex.org/W1992479755","https://openalex.org/W1999867351","https://openalex.org/W2016811480","https://openalex.org/W2024972568","https://openalex.org/W2035099047","https://openalex.org/W2039157284","https://openalex.org/W2053610218","https://openalex.org/W2104935810","https://openalex.org/W2111999854","https://openalex.org/W2119862441","https://openalex.org/W2126343340","https://openalex.org/W2127985326","https://openalex.org/W2135712710","https://openalex.org/W2137942885","https://openalex.org/W2142129424","https://openalex.org/W2142522527","https://openalex.org/W2151342861","https://openalex.org/W2155526624","https://openalex.org/W2165504327","https://openalex.org/W2343644771","https://openalex.org/W2515641369","https://openalex.org/W2613070411","https://openalex.org/W2884345726","https://openalex.org/W2899702797","https://openalex.org/W2915497091","https://openalex.org/W2963973986"],"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/W2588713448","https://openalex.org/W2002272911","https://openalex.org/W2543175834"],"abstract_inverted_index":{"This":[0],"paper":[1],"considers":[2],"the":[3,34,45,54,98],"following":[4],"fundamental":[5],"maximum":[6],"throughput":[7],"routing":[8],"problem:":[9],"given":[10],"a":[11,28,82],"set":[12],"of":[13,30,37,59,85,94,100,134],"k":[14,60],"(splittable)":[15],"multicommodity":[16],"flows":[17,31],"with":[18,69,109],"equal":[19],"demands":[20,43],"in":[21,97,112,126],"an":[22,91,129],"n-node":[23],"network,":[24],"select":[25],"and":[26,61,116],"route":[27],"subset":[29],"such":[32],"that":[33,40,118],"total":[35],"number":[36],"commodities":[38],"routed":[39],"satisfy":[41],"their":[42],"(i.e.,":[44,57],"allor-nothing":[46],"throughput)":[47],"is":[48,53,79],"maximized.":[49],"Our":[50,77],"main":[51],"contribution":[52,108],"first":[55],"constant":[56],"independent":[58],"n)":[62],"through-putapproximation":[63],"algorithm":[64,78,120],"for":[65],"this":[66],"NP-hard":[67],"problem,":[68],"sublin-ear,":[70],"namely":[71],"\u00d5(\u221ak),":[72],"edge":[73,130],"capacity":[74,131],"violation":[75,132],"ratio.":[76],"based":[80],"on":[81],"clever":[83],"application":[84,93],"randomized":[86],"rounding.":[87],"We":[88,104],"also":[89],"present":[90],"interesting":[92],"our":[95,106,119],"result":[96],"context":[99],"delay-tolerant":[101],"network":[102],"scheduling.":[103],"complement":[105],"theoretical":[107],"extensive":[110],"simulation":[111],"two":[113],"different":[114],"scenarios,":[115],"find":[117],"performs":[121],"significantly":[122],"better":[123],"than":[124],"predicted":[125],"theory,":[127],"achieving":[128],"ratio":[133],"at":[135],"most":[136],"3.":[137]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2023,"cited_by_count":3},{"year":2022,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}