{"id":"https://openalex.org/W2883318249","doi":"https://doi.org/10.1137/16m1117317","title":"Online Buy-at-Bulk Network Design","display_name":"Online Buy-at-Bulk Network Design","publication_year":2018,"publication_date":"2018-01-01","ids":{"openalex":"https://openalex.org/W2883318249","doi":"https://doi.org/10.1137/16m1117317","mag":"2883318249"},"language":"en","primary_location":{"id":"doi:10.1137/16m1117317","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1117317","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-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/A5069364300","display_name":"Deeparnab Chakrabarty","orcid":"https://orcid.org/0000-0001-7596-6035"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":true,"raw_author_name":"Deeparnab Chakrabarty","raw_affiliation_strings":["Microsoft Research, 9 Lavelle Road, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, 9 Lavelle Road, Bangalore, India","institution_ids":["https://openalex.org/I4210124949"]}]},{"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/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Alina Ene","raw_affiliation_strings":["Department of Computer Science and DIMAP, University of Warwick, Coventry, UK"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science and DIMAP, University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5060555975","display_name":"Ravishankar Krishnaswamy","orcid":"https://orcid.org/0000-0002-5765-0843"},"institutions":[{"id":"https://openalex.org/I4210124949","display_name":"Microsoft Research (India)","ror":"https://ror.org/02w7f3w92","country_code":"IN","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210124949"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Ravishankar Krishnaswamy","raw_affiliation_strings":["Microsoft Research, 9 Lavelle Road, Bangalore, India"],"affiliations":[{"raw_affiliation_string":"Microsoft Research, 9 Lavelle Road, Bangalore, India","institution_ids":["https://openalex.org/I4210124949"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5087182068","display_name":"Debmalya Panigrahi","orcid":"https://orcid.org/0000-0003-1799-6660"},"institutions":[{"id":"https://openalex.org/I170897317","display_name":"Duke University","ror":"https://ror.org/00py81415","country_code":"US","type":"education","lineage":["https://openalex.org/I170897317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Debmalya Panigrahi","raw_affiliation_strings":["Department of Computer Science, Duke University, Durham, NC, USA"],"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Duke University, Durham, NC, USA","institution_ids":["https://openalex.org/I170897317"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5069364300"],"corresponding_institution_ids":["https://openalex.org/I4210124949"],"apc_list":null,"apc_paid":null,"fwci":0.3909,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.65775456,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"47","issue":"4","first_page":"1505","last_page":"1528"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/T12288","display_name":"Optimization and Search Problems","score":0.9998000264167786,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.9980999827384949,"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/T11182","display_name":"Auction Theory and Applications","score":0.9904999732971191,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.8549692034721375},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.7122093439102173},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.6734175682067871},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.6589980721473694},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.5691998600959778},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5567429661750793},{"id":"https://openalex.org/keywords/matching","display_name":"Matching (statistics)","score":0.5269694328308105},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.5169867277145386},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.4908953309059143},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.4709174335002899},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4384458661079407},{"id":"https://openalex.org/keywords/undirected-graph","display_name":"Undirected graph","score":0.4173225164413452},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.3604404926300049},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.33327093720436096},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2463633120059967}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.8549692034721375},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.7122093439102173},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.6734175682067871},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.6589980721473694},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.5691998600959778},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5567429661750793},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.5269694328308105},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.5169867277145386},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4908953309059143},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.4709174335002899},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4384458661079407},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.4173225164413452},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.3604404926300049},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.33327093720436096},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2463633120059967},{"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/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/16m1117317","is_oa":false,"landing_page_url":"https://doi.org/10.1137/16m1117317","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G2528371460","display_name":"AF: Small: Allocation Algorithms in Online Systems","funder_award_id":"1527084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"},{"id":"https://openalex.org/G4898802086","display_name":null,"funder_award_id":"CCF-1527084","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"},{"id":"https://openalex.org/F4320309133","display_name":"Duke University","ror":"https://ror.org/00py81415"},{"id":"https://openalex.org/F4320309327","display_name":"Google","ror":"https://ror.org/00njsd438"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1759768216","https://openalex.org/W1973444128","https://openalex.org/W1983969450","https://openalex.org/W1986144992","https://openalex.org/W1986201860","https://openalex.org/W1989669912","https://openalex.org/W2005771129","https://openalex.org/W2009976792","https://openalex.org/W2020400310","https://openalex.org/W2022092881","https://openalex.org/W2029437526","https://openalex.org/W2059149798","https://openalex.org/W2059707428","https://openalex.org/W2074121653","https://openalex.org/W2080551019","https://openalex.org/W2108573551","https://openalex.org/W2122886291","https://openalex.org/W2610052675","https://openalex.org/W2620939520","https://openalex.org/W2950524127"],"related_works":["https://openalex.org/W3000166930","https://openalex.org/W4287905780","https://openalex.org/W1587434700","https://openalex.org/W2922865928","https://openalex.org/W2772037640","https://openalex.org/W4300452271","https://openalex.org/W3203512580","https://openalex.org/W1528979437","https://openalex.org/W1863816925","https://openalex.org/W2000793193"],"abstract_inverted_index":{"We":[0,174,207,252],"present":[1],"the":[2,7,20,26,46,65,93,98,116,121,140,162,182,209,239,243,255],"first":[3],"online":[4,38,57,82,177,197],"algorithms":[5,110],"for":[6,25,45,64,73,103,115,134,139,161,188,260],"nonuniform,":[8],"multicommodity":[9],"buy-at-bulk":[10],"(MC-BB)":[11],"network":[12],"design":[13],"problem.":[14],"Our":[15,191],"competitive":[16,43,62,86,113,130],"ratios":[17,114],"qualitatively":[18],"match":[19],"best":[21],"known":[22,133,160,180],"approximation":[23],"factors":[24],"corresponding":[27],"offline":[28,240,250],"problems.":[29,123],"In":[30],"particular,":[31],"we":[32],"show":[33],"(a)":[34],"a":[35,41,54,60,79,85,128,156,246],"polynomial":[36,80],"time":[37,56,81],"algorithm":[39,58,83,158,178],"with":[40,59,84,111],"polylogarithmic":[42,61],"ratio":[44,63,87,131],"MC-BB":[47,66,104,201],"problem":[48,67,165,244],"in":[49,68,105,181,237],"undirected":[50,69],"edge-weighted":[51,136,163],"graphs,":[52,71,107],"(b)":[53],"quasi-polynomial":[55],"node-weighted":[70,183],"(c)":[72],"any":[74],"fixed":[75],"$\\epsilon":[76],">":[77],"0$,":[78],"of":[88,95,119,143,169,200,211,227,242,257],"$\\tilde{O}\\big(k^{\\frac{1}{2}+\\epsilon})$":[89],"(where":[90],"$k$":[91],"is":[92,195],"number":[94],"demands,":[96],"and":[97,108,148,155,184,222],"tilde":[99],"hides":[100],"polylog":[101],"factors)":[102],"directed":[106,185],"(d)":[109],"matching":[112],"prize-collecting":[117],"variant":[118],"all":[120],"preceding":[122],"Prior":[124],"to":[125,203],"our":[126,261],"work,":[127],"logarithmic":[129],"was":[132,159,179],"undirected,":[135],"graphs":[137],"only":[138],"special":[141],"case":[142],"uniform":[144,189],"costs":[145],"[B.":[146],"Awerbuch":[147],"Y.":[149],"Azar,":[150],"FOCS,":[151,228],"1997,":[152],"pp.":[153,172,230],"542--547],":[154],"polylogarithmic-competitive":[157],"single-sink":[164,205],"[A.":[166],"Meyerson,":[167],"Procedings":[168],"SPAA,":[170],"2004,":[171],"275--280].":[173],"believe":[175],"no":[176],"settings,":[186],"even":[187],"costs.":[190],"main":[192],"technical":[193],"contribution":[194],"an":[196,234],"reduction":[198],"theorem":[199],"problems":[202],"their":[204],"counterparts.":[206],"use":[208,253],"concept":[210],"junction-tree":[212],"solutions":[213],"from":[214],"[C.":[215],"Chekuri,":[216],"M.":[217,223],"T.":[218],"Hajiaghayi,":[219],"G.":[220],"Kortsarz,":[221],"R.":[224],"Salavatipour,":[225],"Proceedings":[226],"2006,":[229],"677--686],":[231],"which":[232],"play":[233],"important":[235],"role":[236],"solving":[238],"versions":[241],"via":[245],"greedy":[247],"subroutine---an":[248],"inherently":[249],"procedure.":[251],"just":[254],"existence":[256],"good":[258],"junction-trees":[259],"reduction.":[262]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2}],"updated_date":"2026-04-21T08:09:41.155169","created_date":"2025-10-10T00:00:00"}