{"id":"https://openalex.org/W2163150343","doi":"https://doi.org/10.1109/sfcs.2002.1181956","title":"A constant-factor approximation algorithm for the multicommodity rent-or-buy problem","display_name":"A constant-factor approximation algorithm for the multicommodity rent-or-buy problem","publication_year":2003,"publication_date":"2003-06-26","ids":{"openalex":"https://openalex.org/W2163150343","doi":"https://doi.org/10.1109/sfcs.2002.1181956","mag":"2163150343"},"language":"en","primary_location":{"id":"doi:10.1109/sfcs.2002.1181956","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181956","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},"type":"conference-paper","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/A5029407896","display_name":"Amit Kumar","orcid":"https://orcid.org/0000-0002-3965-6627"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"A. Kumar","raw_affiliation_strings":["Cornell University, Ithaca, NY, USA","Lucent Bell Laboratories, Murray Hill, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]},{"raw_affiliation_string":"Lucent Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5078381067","display_name":"Anupam Gupta","orcid":"https://orcid.org/0000-0001-5579-3405"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"A. Gupta","raw_affiliation_strings":["Lucent Bell Laboratories, Murray Hill, NJ, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lucent Bell Laboratories, Murray Hill, NJ, USA","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022886322","display_name":"Tim Roughgarden","orcid":"https://orcid.org/0000-0002-7163-8306"},"institutions":[{"id":"https://openalex.org/I205783295","display_name":"Cornell University","ror":"https://ror.org/05bnh6r87","country_code":"US","type":"education","lineage":["https://openalex.org/I205783295"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"T. Roughgarden","raw_affiliation_strings":["Department of Computer Science, Cornell University, Ithaca, NY, USA"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computer Science, Cornell University, Ithaca, NY, USA","institution_ids":["https://openalex.org/I205783295"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":55,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"333","last_page":"342"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9912999868392944,"subfield":{"id":"https://openalex.org/subfields/2215","display_name":"Building and Construction"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9882000088691711,"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/T11814","display_name":"Advanced Manufacturing and Logistics Optimization","score":0.9869999885559082,"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/constant","display_name":"Constant (computer programming)","score":0.7619706392288208},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6853644847869873},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5484210252761841},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.47635698318481445},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.47508183121681213},{"id":"https://openalex.org/keywords/factor","display_name":"Factor (programming language)","score":0.4648173451423645},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39441007375717163}],"concepts":[{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.7619706392288208},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6853644847869873},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5484210252761841},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.47635698318481445},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.47508183121681213},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.4648173451423645},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39441007375717163},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0}],"mesh":[],"locations_count":8,"locations":[{"id":"doi:10.1109/sfcs.2002.1181956","is_oa":false,"landing_page_url":"https://doi.org/10.1109/sfcs.2002.1181956","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"The 43rd Annual IEEE Symposium on Foundations of Computer Science, 2002. Proceedings.","raw_type":"proceedings-article"},{"id":"pmh:oai:repository.cmu.edu:compsci-1852","is_oa":false,"landing_page_url":"http://repository.cmu.edu/cgi/viewcontent.cgi?article=1852&context=compsci","pdf_url":null,"source":{"id":"https://openalex.org/S4306400668","display_name":"Research Showcase @ Carnegie Mellon University (Carnegie Mellon University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I74973139","host_organization_name":"Carnegie Mellon University","host_organization_lineage":["https://openalex.org/I74973139"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Computer Science Department","raw_type":"text"},{"id":"pmh:doi:10.1184/r1/6587321","is_oa":false,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Journal contribution"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.114.5571","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.114.5571","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~anupamg/papers/focs02.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.141.6293","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.141.6293","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cmu.edu/~anupamg/papers/focs02.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.1426","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.1426","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cornell.edu/people/amitk/bab.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.70.8489","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.70.8489","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cornell.edu/timr/papers/bab.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.3118","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.3118","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.cornell.edu/timr/papers/bab.ps","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":31,"referenced_works":["https://openalex.org/W1532411173","https://openalex.org/W1544515183","https://openalex.org/W1601812897","https://openalex.org/W1759768216","https://openalex.org/W1891203375","https://openalex.org/W1985672402","https://openalex.org/W1989224473","https://openalex.org/W2001139415","https://openalex.org/W2006514056","https://openalex.org/W2011823863","https://openalex.org/W2020163691","https://openalex.org/W2034457158","https://openalex.org/W2038257218","https://openalex.org/W2041571997","https://openalex.org/W2045906087","https://openalex.org/W2059707428","https://openalex.org/W2092340542","https://openalex.org/W2094410510","https://openalex.org/W2104701012","https://openalex.org/W2106676868","https://openalex.org/W2124295613","https://openalex.org/W2133156969","https://openalex.org/W2139841919","https://openalex.org/W2143061299","https://openalex.org/W2160641050","https://openalex.org/W2161836078","https://openalex.org/W2610631890","https://openalex.org/W6632396972","https://openalex.org/W6637788601","https://openalex.org/W6645550076","https://openalex.org/W6647883457"],"related_works":["https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2052122378","https://openalex.org/W2544423928","https://openalex.org/W2062023542","https://openalex.org/W4313731559"],"abstract_inverted_index":{"We":[0,18],"present":[1],"the":[2,20,104,116,137,145,155,163,167,179,194],"first":[3],"constant":[4,125],"factor":[5,126],"approximation":[6,127],"algorithm":[7],"for":[8,129,166],"network":[9,28,111,195],"design":[10,29,112,196],"with":[11,47],"multiple":[12],"commodities":[13,141],"and":[14,72,149,176],"economies":[15],"of":[16,25,53,64,75,83,94,136,181,187],"scale.":[17],"consider":[19],"rent-or-buy":[21,157,169],"problem,":[22],"a":[23,51,65,70,73,80,91,200],"type":[24],"multicommodity":[26,156,168],"buy-at-bulk":[27,110],"in":[30],"which":[31,58],"there":[32],"are":[33,122],"two":[34],"ways":[35],"to":[36,103,144,154,160],"install":[37],"capacity":[38,54,86],"on":[39,50,87,109,115,178],"any":[40],"given":[41],"edge.":[42],"Capacity":[43],"can":[44,96],"be":[45,97],"rented,":[46],"cost":[48],"incurred":[49],"per-unit":[52],"basis,":[55],"or":[56,186],"bought,":[57],"allows":[59],"unlimited":[60],"use":[61,135],"after":[62],"payment":[63],"large":[66],"fixed":[67],"cost.":[68],"Given":[69],"graph":[71],"set":[74],"source-sink":[76],"pairs,":[77],"we":[78,192],"seek":[79],"minimum-cost":[81],"way":[82],"installing":[84],"sufficient":[85],"edges":[88],"so":[89],"that":[90,139],"prescribed":[92],"amount":[93],"flow":[95,143],"sent":[98],"simultaneously":[99],"from":[100],"each":[101],"source":[102],"corresponding":[105],"sink.":[106],"Recent":[107],"work":[108],"has":[113],"concentrated":[114],"special":[117,131],"case":[118,132],"where":[119],"all":[120,140],"sinks":[121],"identical;":[123],"existing":[124],"algorithms":[128],"this":[130],"make":[133],"crucial":[134],"assumption":[138],"ship":[142],"same":[146],"sink":[147],"vertex":[148],"do":[150],"not":[151],"obviously":[152],"extend":[153],"problem.":[158],"Prior":[159],"our":[161],"work,":[162],"best":[164],"heuristics":[165],"problem":[170,197],"achieved":[171],"only":[172],"logarithmic":[173],"performance":[174],"guarantees":[175],"relied":[177],"machinery":[180],"relaxed":[182],"metrical":[183],"task":[184],"systems":[185],"metric":[188],"embeddings.":[189],"By":[190],"contrast,":[191],"solve":[193],"directly":[198],"via":[199],"novel":[201],"primal-dual":[202],"algorithm.":[203]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}