{"id":"https://openalex.org/W2624136382","doi":"https://doi.org/10.1145/1240233.1240246","title":"Sharing the cost more efficiently","display_name":"Sharing the cost more efficiently","publication_year":2007,"publication_date":"2007-05-01","ids":{"openalex":"https://openalex.org/W2624136382","doi":"https://doi.org/10.1145/1240233.1240246","mag":"2624136382"},"language":"en","primary_location":{"id":"doi:10.1145/1240233.1240246","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1240233.1240246","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","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/A5039929633","display_name":"Luca Becchetti","orcid":"https://orcid.org/0000-0002-4941-0532"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"L. Becchetti","raw_affiliation_strings":["Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Roma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5111545821","display_name":"Jochen K\u00f6nemann","orcid":null},"institutions":[{"id":"https://openalex.org/I151746483","display_name":"University of Waterloo","ror":"https://ror.org/01aff2v68","country_code":"CA","type":"education","lineage":["https://openalex.org/I151746483"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"J. K\u00f6nemann","raw_affiliation_strings":["University of Waterloo, Waterloo, ON"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Waterloo, Waterloo, ON","institution_ids":["https://openalex.org/I151746483"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5102836759","display_name":"Stefano Leonardi","orcid":"https://orcid.org/0000-0002-9809-7191"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"S. Leonardi","raw_affiliation_strings":["Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Roma, Italy"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Universit\u00e0 di Roma \u201cLa Sapienza\u201d, Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5075539865","display_name":"M. P\u00e1al","orcid":null},"institutions":[{"id":"https://openalex.org/I1291425158","display_name":"Google (United States)","ror":"https://ror.org/00njsd438","country_code":"US","type":"company","lineage":["https://openalex.org/I1291425158","https://openalex.org/I4210128969"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"M. P\u00e1al","raw_affiliation_strings":["Google Inc., New York, NY"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Google Inc., New York, NY","institution_ids":["https://openalex.org/I1291425158"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.9972,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.81391261,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"3","issue":"2","first_page":"23","last_page":"23"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"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"}},"topics":[{"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"}},{"id":"https://openalex.org/T11182","display_name":"Auction Theory and Applications","score":0.9951000213623047,"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"}},{"id":"https://openalex.org/T12546","display_name":"Smart Parking Systems Research","score":0.9941999912261963,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6838188171386719},{"id":"https://openalex.org/keywords/minimum-cost-flow-problem","display_name":"Minimum-cost flow problem","score":0.5904208421707153},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.5710505247116089},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5506236553192139},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.46344590187072754},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4579952359199524},{"id":"https://openalex.org/keywords/provisioning","display_name":"Provisioning","score":0.44976434111595154},{"id":"https://openalex.org/keywords/flow-network","display_name":"Flow network","score":0.4202916920185089},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35234910249710083},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3224020004272461},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.09874728322029114}],"concepts":[{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6838188171386719},{"id":"https://openalex.org/C99545648","wikidata":"https://www.wikidata.org/wiki/Q2897180","display_name":"Minimum-cost flow problem","level":3,"score":0.5904208421707153},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.5710505247116089},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5506236553192139},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.46344590187072754},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4579952359199524},{"id":"https://openalex.org/C172191483","wikidata":"https://www.wikidata.org/wiki/Q1071806","display_name":"Provisioning","level":2,"score":0.44976434111595154},{"id":"https://openalex.org/C114809511","wikidata":"https://www.wikidata.org/wiki/Q1412924","display_name":"Flow network","level":2,"score":0.4202916920185089},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35234910249710083},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3224020004272461},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.09874728322029114}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/1240233.1240246","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1240233.1240246","pdf_url":null,"source":{"id":"https://openalex.org/S137348503","display_name":"ACM Transactions on Algorithms","issn_l":"1549-6325","issn":["1549-6325","1549-6333"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"ACM Transactions on Algorithms","raw_type":"journal-article"},{"id":"pmh:oai:iris.uniroma1.it:11573/238026","is_oa":false,"landing_page_url":"http://hdl.handle.net/11573/238026","pdf_url":null,"source":{"id":"https://openalex.org/S4377196107","display_name":"IRIS Research product catalog (Sapienza University of Rome)","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":"info:eu-repo/semantics/article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Life in Land","id":"https://metadata.un.org/sdg/15","score":0.5400000214576721}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":15,"referenced_works":["https://openalex.org/W1981673685","https://openalex.org/W2001139415","https://openalex.org/W2011039300","https://openalex.org/W2011823863","https://openalex.org/W2041571997","https://openalex.org/W2078850190","https://openalex.org/W2079936083","https://openalex.org/W2095969632","https://openalex.org/W2097181193","https://openalex.org/W2107390991","https://openalex.org/W2123442845","https://openalex.org/W2133156969","https://openalex.org/W2142779979","https://openalex.org/W4285719527","https://openalex.org/W6602704705"],"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/W3184075718","https://openalex.org/W2995411114","https://openalex.org/W2004321562","https://openalex.org/W3141113327","https://openalex.org/W2080904092"],"abstract_inverted_index":{"In":[0,67,168],"the":[1,41,71,108,121,130,134,141,162,176,181,207,211,225,228],"multicommodity":[2],"rent-or-buy":[3,164],"(MROB)":[4],"network":[5,12,42,165],"design":[6,166],"problems,":[7],"we":[8,171],"are":[9],"given":[10,46],"a":[11,15,45,118,127,173,199],"together":[13],"with":[14],"set":[16],"of":[17,48,85,129,143,183,206],"k":[18,31,34,65],"terminal":[19,131],"pairs":[20,132],"(":[21,29],"s":[22,30,54],"1":[23,26,61],",":[24,32],"t":[25,33,57],"),":[27],"\u2026,":[28],".":[35],"The":[36,102,191],"goal":[37],"is":[38,105,196],"to":[39,69,106,216],"provision":[40,70],"so":[43],"that":[44],"amount":[47],"flow":[49],"can":[50,74],"be":[51],"shipped":[52],"between":[53,227],"i":[55,58,63],"and":[56,138,187,203,230],"for":[59,120,148,161,175,210],"all":[60],"\u2264":[62,64],"simultaneously.":[66],"order":[68],"network,":[72],"one":[73],"either":[75],"rent":[76],"capacity":[77],"on":[78,198],"edges":[79,96,142],"at":[80,90,136],"some":[81,91],"cost":[82],"per":[83],"unit":[84],"flow,":[86],"or":[87],"buy":[88],"them":[89],"larger":[92],"fixed":[93],"cost.":[94,101,111],"Bought":[95],"have":[97],"no":[98],"incremental,":[99],"flow-dependent":[100],"overall":[103],"objective":[104],"minimize":[107],"total":[109],"provisioning":[110],"Recently,":[112],"Gupta":[113,184],"et":[114,158,185,218],"al.":[115,159,186,219],"[2003a]":[116],"presented":[117],"12-approximation":[119],"MROB":[122,177],"problem.":[123,167],"Their":[124],"algroithm":[125],"chooses":[126],"subset":[128],"in":[133,193],"graph":[135],"random":[137],"then":[139],"buys":[140],"an":[144],"approximate":[145],"Steiner":[146,212],"forest":[147,213],"these":[149],"pairs.":[150],"This":[151],"technique":[152],"had":[153],"previously":[154],"been":[155],"introduced":[156],"[Gupta":[157],"2003b]":[160],"single-sink":[163,229],"this":[169],"article":[170,195],"give":[172],"6.828-approximation":[174],"problem":[178,214],"by":[179],"refining":[180],"algorithm":[182,209],"simplifying":[188],"their":[189],"analysis.":[190],"improvement":[192],"our":[194],"based":[197],"more":[200],"careful":[201],"adaptation":[202],"simplified":[204],"analysis":[205],"primal-dual":[208],"due":[215],"Agrawal":[217],"[1995].":[220],"Our":[221],"result":[222],"significantly":[223],"reduces":[224],"gap":[226],"multisink":[231],"case.":[232]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}