{"id":"https://openalex.org/W3004444832","doi":"https://doi.org/10.1145/3377387","title":"Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency","display_name":"Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency","publication_year":2020,"publication_date":"2020-02-07","ids":{"openalex":"https://openalex.org/W3004444832","doi":"https://doi.org/10.1145/3377387","mag":"3004444832"},"language":"en","primary_location":{"id":"doi:10.1145/3377387","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377387","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://purehost.bath.ac.uk/ws/files/210507892/submission_to_jacm_24_12_2019.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5000264005","display_name":"Yuval Emek","orcid":"https://orcid.org/0000-0002-3123-3451"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yuval Emek","raw_affiliation_strings":["Technion - Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5033442948","display_name":"Shay Kutten","orcid":"https://orcid.org/0000-0003-2062-6855"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Shay Kutten","raw_affiliation_strings":["Technion - Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5026026890","display_name":"Ron Lavi","orcid":"https://orcid.org/0000-0002-5215-5165"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Ron Lavi","raw_affiliation_strings":["Technion - Israel Institute of Technology, Haifa, Israel"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5103078568","display_name":"Yangguang Shi","orcid":"https://orcid.org/0000-0003-2923-2748"},"institutions":[{"id":"https://openalex.org/I174306211","display_name":"Technion \u2013 Israel Institute of Technology","ror":"https://ror.org/03qryx823","country_code":"IL","type":"education","lineage":["https://openalex.org/I174306211"]}],"countries":["IL"],"is_corresponding":false,"raw_author_name":"Yangguang Shi","raw_affiliation_strings":["Technion - Israel Institute of Technology, Haifa, Israel"],"raw_orcid":"https://orcid.org/0000-0003-2923-2748","affiliations":[{"raw_affiliation_string":"Technion - Israel Institute of Technology, Haifa, Israel","institution_ids":["https://openalex.org/I174306211"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I174306211"],"apc_list":null,"apc_paid":null,"fwci":0.4372,"has_fulltext":true,"cited_by_count":5,"citation_normalized_percentile":{"value":0.67370525,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":95},"biblio":{"volume":"67","issue":"1","first_page":"1","last_page":"33"},"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.9991000294685364,"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.9991000294685364,"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.9975000023841858,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9943000078201294,"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/subadditivity","display_name":"Subadditivity","score":0.9119359254837036},{"id":"https://openalex.org/keywords/steiner-tree-problem","display_name":"Steiner tree problem","score":0.6996303200721741},{"id":"https://openalex.org/keywords/approximation-algorithm","display_name":"Approximation algorithm","score":0.6764178276062012},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.608951985836029},{"id":"https://openalex.org/keywords/superadditivity","display_name":"Superadditivity","score":0.4923018217086792},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4844367802143097},{"id":"https://openalex.org/keywords/submodular-set-function","display_name":"Submodular set function","score":0.455790638923645},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.45566147565841675},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4273705780506134},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3105483949184418},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.3079666197299957},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2016633152961731},{"id":"https://openalex.org/keywords/mathematical-economics","display_name":"Mathematical economics","score":0.17171752452850342}],"concepts":[{"id":"https://openalex.org/C19220575","wikidata":"https://www.wikidata.org/wiki/Q1934099","display_name":"Subadditivity","level":2,"score":0.9119359254837036},{"id":"https://openalex.org/C76220878","wikidata":"https://www.wikidata.org/wiki/Q1764144","display_name":"Steiner tree problem","level":2,"score":0.6996303200721741},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.6764178276062012},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.608951985836029},{"id":"https://openalex.org/C20017120","wikidata":"https://www.wikidata.org/wiki/Q922087","display_name":"Superadditivity","level":2,"score":0.4923018217086792},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4844367802143097},{"id":"https://openalex.org/C178621042","wikidata":"https://www.wikidata.org/wiki/Q7631710","display_name":"Submodular set function","level":2,"score":0.455790638923645},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.45566147565841675},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4273705780506134},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3105483949184418},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3079666197299957},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2016633152961731},{"id":"https://openalex.org/C144237770","wikidata":"https://www.wikidata.org/wiki/Q747534","display_name":"Mathematical economics","level":1,"score":0.17171752452850342},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3377387","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3377387","pdf_url":null,"source":{"id":"https://openalex.org/S118992489","display_name":"Journal of the ACM","issn_l":"0004-5411","issn":["0004-5411","1557-735X"],"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":"Journal of the ACM","raw_type":"journal-article"},{"id":"pmh:oai:purehost.bath.ac.uk:openaire/45998b57-27f5-436e-b0ba-4edff1a1e04b","is_oa":true,"landing_page_url":"https://researchportal.bath.ac.uk/en/publications/45998b57-27f5-436e-b0ba-4edff1a1e04b","pdf_url":"https://purehost.bath.ac.uk/ws/files/210507892/submission_to_jacm_24_12_2019.pdf","source":{"id":"https://openalex.org/S4377196294","display_name":"Pure (University of Bath)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I51601045","host_organization_name":"University of Bath","host_organization_lineage":["https://openalex.org/I51601045"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Emek, Y, Kutten, S, Lavi, R & Shi, Y 2020, 'Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency', Journal of the ACM, vol. 67, no. 1, 7, pp. 1-33. https://doi.org/10.1145/3377387","raw_type":"article"}],"best_oa_location":{"id":"pmh:oai:purehost.bath.ac.uk:openaire/45998b57-27f5-436e-b0ba-4edff1a1e04b","is_oa":true,"landing_page_url":"https://researchportal.bath.ac.uk/en/publications/45998b57-27f5-436e-b0ba-4edff1a1e04b","pdf_url":"https://purehost.bath.ac.uk/ws/files/210507892/submission_to_jacm_24_12_2019.pdf","source":{"id":"https://openalex.org/S4377196294","display_name":"Pure (University of Bath)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I51601045","host_organization_name":"University of Bath","host_organization_lineage":["https://openalex.org/I51601045"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Emek, Y, Kutten, S, Lavi, R & Shi, Y 2020, 'Approximating Generalized Network Design under (Dis)economies of Scale with Applications to Energy Efficiency', Journal of the ACM, vol. 67, no. 1, 7, pp. 1-33. https://doi.org/10.1145/3377387","raw_type":"article"},"sustainable_development_goals":[{"display_name":"Affordable and clean energy","id":"https://metadata.un.org/sdg/7","score":0.8299999833106995}],"awards":[{"id":"https://openalex.org/G455088292","display_name":null,"funder_award_id":"1016/17","funder_id":"https://openalex.org/F4320322252","funder_display_name":"Israel Science Foundation"},{"id":"https://openalex.org/G6149838373","display_name":null,"funder_award_id":"2560/17","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"},{"id":"https://openalex.org/F4320322252","display_name":"Israel Science Foundation","ror":"https://ror.org/04sazxf24"},{"id":"https://openalex.org/F4320323278","display_name":"Council for Higher Education","ror":"https://ror.org/036mqp197"},{"id":"https://openalex.org/F4320334764","display_name":"Japan Society for the Promotion of Science","ror":"https://ror.org/00hhkn466"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3004444832.pdf","grobid_xml":"https://content.openalex.org/works/W3004444832.grobid-xml"},"referenced_works_count":41,"referenced_works":["https://openalex.org/W172801039","https://openalex.org/W1976584101","https://openalex.org/W2005012890","https://openalex.org/W2009636784","https://openalex.org/W2010781926","https://openalex.org/W2011823863","https://openalex.org/W2014008637","https://openalex.org/W2014369282","https://openalex.org/W2015231501","https://openalex.org/W2026823795","https://openalex.org/W2030208840","https://openalex.org/W2056930089","https://openalex.org/W2059149798","https://openalex.org/W2065827889","https://openalex.org/W2070226247","https://openalex.org/W2074104906","https://openalex.org/W2084224084","https://openalex.org/W2095094403","https://openalex.org/W2102201348","https://openalex.org/W2104144451","https://openalex.org/W2106699718","https://openalex.org/W2113726644","https://openalex.org/W2127813674","https://openalex.org/W2133156969","https://openalex.org/W2137097622","https://openalex.org/W2138779116","https://openalex.org/W2153230844","https://openalex.org/W2164115065","https://openalex.org/W2169143327","https://openalex.org/W2169401877","https://openalex.org/W2169528473","https://openalex.org/W2185824006","https://openalex.org/W2199385070","https://openalex.org/W2216069195","https://openalex.org/W2227904476","https://openalex.org/W2251356912","https://openalex.org/W2294025081","https://openalex.org/W2620939520","https://openalex.org/W2950300858","https://openalex.org/W3195233517","https://openalex.org/W4234285775"],"related_works":["https://openalex.org/W1545891988","https://openalex.org/W4302085088","https://openalex.org/W2950082292","https://openalex.org/W2560457344","https://openalex.org/W1180893010","https://openalex.org/W3124089944","https://openalex.org/W2529372321","https://openalex.org/W3006632508","https://openalex.org/W2503243575","https://openalex.org/W2235694368"],"abstract_inverted_index":{"In":[0],"a":[1,7,33,44,56,129,138,180,265],"generalized":[2],"network":[3],"design":[4,315],"(GND)":[5],"problem,":[6],"set":[8],"of":[9,67,142,147,207,219,244,294,305,309,316,332,338],"resources":[10,25,120,162],"are":[11,110,224],"assigned":[12],"(non-exclusively)":[13],"to":[14,23,38,112,186],"multiple":[15],"requests":[16,114,143],".":[17],"Each":[18],"request":[19,181],"contributes":[20,182],"its":[21],"weight":[22,185],"the":[24,29,39,89,107,119,122,125,161,168,171,175,183,200,205,220,242,250,257,261,278,292,295,303,307,329,336],"it":[26,41,189],"uses":[27],"and":[28,80,150,157,235,274,298],"total":[30],"load":[31],"on":[32,92,226,291,322],"resource":[34,188],"is":[35,55,232,253],"then":[36],"translated":[37],"cost":[40,46,62,72,100,214,246,286],"incurs":[42],"via":[43],"resource-specific":[45],"function.":[47],"Motivated":[48],"by":[49],"energy":[50,271],"efficiency":[51],"applications,":[52],"recently,":[53],"there":[54],"growing":[57],"interest":[58],"in":[59,102,115,154,237,249,260,335],"GND":[60,96,283],"using":[61],"functions":[63,73,101,247,287],"that":[64,74,133,179,288],"exhibit":[65],"(dis)economies":[66],"scale":[68],"((D)oS)":[69],",":[70],"namely,":[71],"appear":[75],"subadditive":[76],"for":[77,82,95,137,195,204,269,282],"small":[78],"loads":[79],"superadditive":[81],"larger":[83],"loads.":[84],"The":[85,314],"current":[86,126,251],"article":[87,127,252],"advances":[88],"existing":[90,108,176,221,262],"literature":[91],"approximation":[93,131,135,192,203,222,230,280,318,339],"algorithms":[94,223],"problems":[97],"with":[98,121,166,212,284,302],"(D)oS":[99,213,245,285],"various":[103,145],"aspects:":[104],"(1)":[105],"while":[106,174,217],"results":[109,136,177],"restricted":[111],"routing":[113],"undirected":[116,158],"graphs,":[117,159],"identifying":[118],"graph\u2019s":[123],"edges,":[124],"presents":[128],"generic":[130],"framework":[132,193,231,319],"yields":[134],"much":[139],"wider":[140],"family":[141,243],"(including":[144],"types":[146],"Steiner":[148,151],"tree":[149],"forest":[152],"requests)":[153],"both":[155],"directed":[156],"where":[160],"can":[163],"be":[164],"identified":[165],"either":[167],"edges":[169],"or":[170,311],"vertices;":[172],"(2)":[173],"assume":[178],"same":[184],"each":[187],"uses,":[190],"our":[191,229,317],"allows":[194],"unrelated":[196,209],"weights,":[197],"thus":[198,327],"providing":[199,264],"first":[201,279],"non-trivial":[202],"problem":[206],"scheduling":[208],"parallel":[210],"machines":[211],"functions;":[215],"(3)":[216],"most":[218],"based":[225],"convex":[227],"programming,":[228],"fully":[233],"combinatorial":[234],"runs":[236],"strongly":[238],"polynomial":[239],"time;":[240],"(4)":[241],"considered":[248,259],"more":[254,266],"general":[255],"than":[256],"one":[258],"literature,":[263],"accurate":[267],"abstraction":[268],"practical":[270],"conservation":[272],"scenarios;":[273],"(5)":[275],"we":[276],"obtain":[277],"ratio":[281],"depends":[289],"only":[290],"parameters":[293],"resources\u2019":[296],"technology":[297],"does":[299],"not":[300],"grow":[301],"number":[304,308],"resources,":[306],"requests,":[310],"their":[312],"weights.":[313],"relies":[320],"heavily":[321],"Roughgarden\u2019s":[323],"smoothness":[324],"toolbox":[325,334],"[43],":[326],"demonstrating":[328],"possible":[330],"usefulness":[331],"this":[333],"area":[337],"algorithms.":[340]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}