{"id":"https://openalex.org/W2020400310","doi":"https://doi.org/10.1137/090750317","title":"Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design","display_name":"Approximation Algorithms for Nonuniform Buy-at-Bulk Network Design","publication_year":2010,"publication_date":"2010-01-01","ids":{"openalex":"https://openalex.org/W2020400310","doi":"https://doi.org/10.1137/090750317","mag":"2020400310"},"language":"en","primary_location":{"id":"doi:10.1137/090750317","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090750317","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/A5036503505","display_name":"Chandra Chekuri","orcid":"https://orcid.org/0000-0003-3035-1699"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"C. Chekuri","raw_affiliation_strings":["chekuri@cs.illinois.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"chekuri@cs.illinois.edu#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5114053165","display_name":"Mohammad Taghi Hajiaghayi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. T. Hajiaghayi","raw_affiliation_strings":["hajiagha@research.att.com#TAB#"],"affiliations":[{"raw_affiliation_string":"hajiagha@research.att.com#TAB#","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5056370891","display_name":"Guy Kortsarz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"G. Kortsarz","raw_affiliation_strings":["guyk@crab.rutgers.edu#TAB#"],"affiliations":[{"raw_affiliation_string":"guyk@crab.rutgers.edu#TAB#","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5010339836","display_name":"Mohammad R. Salavatipour","orcid":"https://orcid.org/0000-0002-7650-2045"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"M. R. Salavatipour","raw_affiliation_strings":["mreza@cs.ualberta.ca#TAB#"],"affiliations":[{"raw_affiliation_string":"mreza@cs.ualberta.ca#TAB#","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5036503505"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":5.1245,"has_fulltext":false,"cited_by_count":47,"citation_normalized_percentile":{"value":0.95487638,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":"39","issue":"5","first_page":"1772","last_page":"1798"},"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.9997000098228455,"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.9997000098228455,"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/T10374","display_name":"Advanced Graph Theory Research","score":0.9983999729156494,"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.9977999925613403,"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/approximation-algorithm","display_name":"Approximation algorithm","score":0.7311134934425354},{"id":"https://openalex.org/keywords/logarithm","display_name":"Logarithm","score":0.7162420749664307},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6434898972511292},{"id":"https://openalex.org/keywords/network-planning-and-design","display_name":"Network planning and design","score":0.6356861591339111},{"id":"https://openalex.org/keywords/multi-commodity-flow-problem","display_name":"Multi-commodity flow problem","score":0.5508907437324524},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.48988431692123413},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4859067499637604},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.48552513122558594},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4827365279197693},{"id":"https://openalex.org/keywords/purchasing","display_name":"Purchasing","score":0.43780848383903503},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.41986164450645447},{"id":"https://openalex.org/keywords/enhanced-data-rates-for-gsm-evolution","display_name":"Enhanced Data Rates for GSM Evolution","score":0.41735637187957764},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4113454818725586},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36941415071487427},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.08521181344985962}],"concepts":[{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.7311134934425354},{"id":"https://openalex.org/C39927690","wikidata":"https://www.wikidata.org/wiki/Q11197","display_name":"Logarithm","level":2,"score":0.7162420749664307},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6434898972511292},{"id":"https://openalex.org/C114563136","wikidata":"https://www.wikidata.org/wiki/Q19725982","display_name":"Network planning and design","level":2,"score":0.6356861591339111},{"id":"https://openalex.org/C170334043","wikidata":"https://www.wikidata.org/wiki/Q6934437","display_name":"Multi-commodity flow problem","level":3,"score":0.5508907437324524},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.48988431692123413},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4859067499637604},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.48552513122558594},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4827365279197693},{"id":"https://openalex.org/C2778813691","wikidata":"https://www.wikidata.org/wiki/Q1369832","display_name":"Purchasing","level":2,"score":0.43780848383903503},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.41986164450645447},{"id":"https://openalex.org/C162307627","wikidata":"https://www.wikidata.org/wiki/Q204833","display_name":"Enhanced Data Rates for GSM Evolution","level":2,"score":0.41735637187957764},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4113454818725586},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36941415071487427},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.08521181344985962},{"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/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","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/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C21547014","wikidata":"https://www.wikidata.org/wiki/Q1423657","display_name":"Operations management","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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1137/090750317","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090750317","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"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.411.6273","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.6273","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~guyk/pub/frb/journal.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.411.7327","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.7327","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~guyk/pub/frb/revised2.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.411.7989","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.411.7989","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://crab.rutgers.edu/~guyk/pub/frb/old.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":26,"referenced_works":["https://openalex.org/W1786215221","https://openalex.org/W1963899113","https://openalex.org/W1968690018","https://openalex.org/W1989669912","https://openalex.org/W1990313671","https://openalex.org/W2001139415","https://openalex.org/W2003159902","https://openalex.org/W2011823863","https://openalex.org/W2034112563","https://openalex.org/W2034457158","https://openalex.org/W2039298646","https://openalex.org/W2040924621","https://openalex.org/W2041571997","https://openalex.org/W2059453880","https://openalex.org/W2059707428","https://openalex.org/W2098907131","https://openalex.org/W2108573551","https://openalex.org/W2114493937","https://openalex.org/W2133156969","https://openalex.org/W2142758253","https://openalex.org/W2142779979","https://openalex.org/W2163150343","https://openalex.org/W2166747457","https://openalex.org/W2172955861","https://openalex.org/W3030774092","https://openalex.org/W3215246336"],"related_works":["https://openalex.org/W2367195720","https://openalex.org/W1968497507","https://openalex.org/W1998126097","https://openalex.org/W1980288485","https://openalex.org/W2009976792","https://openalex.org/W2004321562","https://openalex.org/W4231500168","https://openalex.org/W328736688","https://openalex.org/W2995411114","https://openalex.org/W2071199983"],"abstract_inverted_index":{"Buy-at-bulk":[0],"network":[1,25,45,153],"design":[2,46,154],"problems":[3,47,115],"arise":[4],"in":[5],"settings":[6],"where":[7,89],"the":[8,63,69,82,92,106,122,131,136],"costs":[9,49],"for":[10,43,68,105,112,121,152],"purchasing":[11],"or":[12],"installing":[13],"equipment":[14],"exhibit":[15],"economies":[16],"of":[17,26,55,94,138],"scale.":[18],"The":[19],"objective":[20],"is":[21,62,86,91,125],"to":[22,29,130],"build":[23],"a":[24,31,128,146],"cheapest":[27],"cost":[28,75],"support":[30],"given":[32],"multicommodity":[33,123],"flow":[34],"demand":[35,95],"between":[36],"node":[37],"pairs.":[38,96],"We":[39,141],"present":[40,100],"approximation":[41,66,104],"algorithms":[42],"buy-at-bulk":[44],"with":[48],"on":[50,77],"both":[51],"edges":[52],"and":[53,80],"nodes":[54],"an":[56,101],"undirected":[57],"graph.":[58],"Our":[59,119],"main":[60],"result":[61],"first":[64],"poly-logarithmic":[65],"ratio":[67,83],"non-uniform":[70],"problem":[71,124,134],"that":[72,143],"allows":[73],"different":[74],"functions":[76],"each":[78],"edge":[79],"node;":[81],"we":[84,99],"achieve":[85],"$O(\\log^4":[87],"h)$,":[88],"h":[90],"number":[93],"In":[97],"addition":[98],"$O(\\log":[102],"h)$":[103],"single":[107,132],"sink":[108],"problem.":[109],"Poly-logarithmic":[110],"ratios":[111],"some":[113],"related":[114],"are":[116],"also":[117],"obtained.":[118],"algorithm":[120],"obtained":[126],"via":[127],"reduction":[129],"source":[133],"using":[135],"notion":[137],"junction":[139],"trees.":[140],"believe":[142],"this":[144],"presents":[145],"simple":[147],"yet":[148],"useful":[149],"general":[150],"technique":[151],"problems.":[155]},"counts_by_year":[{"year":2025,"cited_by_count":3},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":5},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":3},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":7},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":2}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}