{"id":"https://openalex.org/W2097190088","doi":"https://doi.org/10.1145/2438645.2438650","title":"Speed Scaling with an Arbitrary Power Function","display_name":"Speed Scaling with an Arbitrary Power Function","publication_year":2013,"publication_date":"2013-03-01","ids":{"openalex":"https://openalex.org/W2097190088","doi":"https://doi.org/10.1145/2438645.2438650","mag":"2097190088"},"language":"en","primary_location":{"id":"doi:10.1145/2438645.2438650","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2438645.2438650","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":true,"oa_status":"green","oa_url":"https://ir.cwi.nl/pub/22205","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5008689083","display_name":"Nikhil Bansal","orcid":"https://orcid.org/0000-0002-6290-0894"},"institutions":[{"id":"https://openalex.org/I83019370","display_name":"Eindhoven University of Technology","ror":"https://ror.org/02c2kyt77","country_code":"NL","type":"education","lineage":["https://openalex.org/I83019370"]}],"countries":["NL"],"is_corresponding":true,"raw_author_name":"Nikhil Bansal","raw_affiliation_strings":["Eindhoven University of Technology","EINDHOVEN UNIVERSITY OF TECHNOLOGY"],"affiliations":[{"raw_affiliation_string":"Eindhoven University of Technology","institution_ids":["https://openalex.org/I83019370"]},{"raw_affiliation_string":"EINDHOVEN UNIVERSITY OF TECHNOLOGY","institution_ids":["https://openalex.org/I83019370"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109857068","display_name":"Ho-Leung Chan","orcid":null},"institutions":[{"id":"https://openalex.org/I889458895","display_name":"University of Hong Kong","ror":"https://ror.org/02zhqgq86","country_code":"HK","type":"education","lineage":["https://openalex.org/I889458895"]}],"countries":["HK"],"is_corresponding":false,"raw_author_name":"Ho-Leung Chan","raw_affiliation_strings":["The University of Hong Kong"],"affiliations":[{"raw_affiliation_string":"The University of Hong Kong","institution_ids":["https://openalex.org/I889458895"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5046525615","display_name":"Kirk Pruhs","orcid":"https://orcid.org/0000-0001-5680-1753"},"institutions":[{"id":"https://openalex.org/I170201317","display_name":"University of Pittsburgh","ror":"https://ror.org/01an3r305","country_code":"US","type":"education","lineage":["https://openalex.org/I170201317"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Kirk Pruhs","raw_affiliation_strings":["University of Pittsburgh"],"affiliations":[{"raw_affiliation_string":"University of Pittsburgh","institution_ids":["https://openalex.org/I170201317"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008689083"],"corresponding_institution_ids":["https://openalex.org/I83019370"],"apc_list":null,"apc_paid":null,"fwci":3.3931,"has_fulltext":false,"cited_by_count":24,"citation_normalized_percentile":{"value":0.93130387,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":"9","issue":"2","first_page":"1","last_page":"14"},"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.9976999759674072,"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/T10551","display_name":"Scheduling and Optimization Algorithms","score":0.9925000071525574,"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/competitive-analysis","display_name":"Competitive analysis","score":0.6616483330726624},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.6434165835380554},{"id":"https://openalex.org/keywords/scaling","display_name":"Scaling","score":0.5973186492919922},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5532709956169128},{"id":"https://openalex.org/keywords/flow-shop-scheduling","display_name":"Flow shop scheduling","score":0.47380369901657104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4687018096446991},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.4495670199394226},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.4241904616355896},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4146023094654083},{"id":"https://openalex.org/keywords/job-shop-scheduling","display_name":"Job shop scheduling","score":0.41030973196029663},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4059251546859741},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.22335192561149597}],"concepts":[{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.6616483330726624},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.6434165835380554},{"id":"https://openalex.org/C99844830","wikidata":"https://www.wikidata.org/wiki/Q102441924","display_name":"Scaling","level":2,"score":0.5973186492919922},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5532709956169128},{"id":"https://openalex.org/C158336966","wikidata":"https://www.wikidata.org/wiki/Q3074426","display_name":"Flow shop scheduling","level":4,"score":0.47380369901657104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4687018096446991},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.4495670199394226},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.4241904616355896},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4146023094654083},{"id":"https://openalex.org/C55416958","wikidata":"https://www.wikidata.org/wiki/Q6206757","display_name":"Job shop scheduling","level":3,"score":0.41030973196029663},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4059251546859741},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.22335192561149597},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C68387754","wikidata":"https://www.wikidata.org/wiki/Q7271585","display_name":"Schedule","level":2,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0},{"id":"https://openalex.org/C78458016","wikidata":"https://www.wikidata.org/wiki/Q840400","display_name":"Evolutionary biology","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":12,"locations":[{"id":"doi:10.1145/2438645.2438650","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2438645.2438650","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:pure.tue.nl:publications/691395e5-4a3f-4260-8bd4-ea1b7323a829","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/691395e5-4a3f-4260-8bd4-ea1b7323a829","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Chan, H L & Pruhs, K R 2009, Speed scaling with an arbitrary power function. in C Mathieu (ed.), Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09, New York NY, USA, January 4-6, 2009). Association for Computing Machinery, Inc., New York, pp. 693-701.","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:oai:pure.tue.nl:publications/aebe48b2-6231-44c2-8ba6-269a62e35025","is_oa":false,"landing_page_url":"https://research.tue.nl/en/publications/aebe48b2-6231-44c2-8ba6-269a62e35025","pdf_url":null,"source":{"id":"https://openalex.org/S4406922641","display_name":"TU/e Research Portal","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":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Bansal, N, Chan, H L & Pruhs, K R 2013, 'Speed scaling with an arbitrary power function', ACM Transactions on Algorithms, vol. 9, no. 2, pp. 18:1-14. https://doi.org/10.1145/2438645.2438650","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:cwi:oai:cwi.nl:22205","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/22205","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"ACM Transactions on Algorithms, 9(2)","raw_type":"info:eu-repo/semantics/article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.566.2150","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.566.2150","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mpi-inf.mpg.de/~hlchan/papers/soda13.pdf","raw_type":"text"},{"id":"pmh:oai:edoc.mpg.de:518345","is_oa":false,"landing_page_url":"http://edoc.mpg.de/518345","pdf_url":null,"source":{"id":"https://openalex.org/S4406922265","display_name":"Max Planck Institute for Plasma Physics","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":"Mathieu, Claire: Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), ACM Press, 693-701 (2009)","raw_type":"Conference-Paper"},{"id":"pmh:oai:hub.hku.hk:10722/125690","is_oa":false,"landing_page_url":"http://hdl.handle.net/10722/125690","pdf_url":null,"source":{"id":"https://openalex.org/S4377196271","display_name":"The HKU Scholars Hub (University of Hong Kong)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I889458895","host_organization_name":"University of Hong Kong","host_organization_lineage":["https://openalex.org/I889458895"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference_Paper"},{"id":"pmh:oai:library.tue.nl:694910","is_oa":false,"landing_page_url":"http://repository.tue.nl/694910","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"","raw_type":""},{"id":"pmh:oai:library.tue.nl:750662","is_oa":false,"landing_page_url":"http://repository.tue.nl/750662","pdf_url":null,"source":{"id":"https://openalex.org/S4406923046","display_name":"TU/e Research Portal (Eindhoven University of Technology)","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":"ISSN:1549-6325","raw_type":"Article / Letter to the editor"},{"id":"pmh:oai:pure.mpg.de:item_1324178","is_oa":false,"landing_page_url":"http://hdl.handle.net/11858/00-001M-0000-000F-18D3-F","pdf_url":null,"source":{"id":"https://openalex.org/S4306400654","display_name":"MPG.PuRe (Max Planck Society)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I149899117","host_organization_name":"Max Planck Society","host_organization_lineage":["https://openalex.org/I149899117"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:tue:oai:pure.tue.nl:publications/691395e5-4a3f-4260-8bd4-ea1b7323a829","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/691395e5-4a3f-4260-8bd4-ea1b7323a829","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Proceedings of the Twentieth Annual ACM-SIAM Symposium on Discrete Algorithms (SODA'09, New York NY, USA, January 4-6, 2009), 693 - 701","raw_type":"info:eu-repo/semantics/conferencepaper"},{"id":"pmh:tue:oai:pure.tue.nl:publications/aebe48b2-6231-44c2-8ba6-269a62e35025","is_oa":false,"landing_page_url":"https://research.tue.nl/nl/publications/aebe48b2-6231-44c2-8ba6-269a62e35025","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"ACM Transactions on Algorithms, 9(2), 18:1 - 14. Association for Computing Machinery, Inc","raw_type":"info:eu-repo/semantics/article"}],"best_oa_location":{"id":"pmh:cwi:oai:cwi.nl:22205","is_oa":true,"landing_page_url":"https://ir.cwi.nl/pub/22205","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"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":"ACM Transactions on Algorithms, 9(2)","raw_type":"info:eu-repo/semantics/article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1209762233","display_name":null,"funder_award_id":"CNS-0325353, CCF-0514058, IIS-0534531, CCF-083558, CCF-1115575","funder_id":"https://openalex.org/F4320337388","funder_display_name":"Division of Computer and Network Systems"},{"id":"https://openalex.org/G2982345064","display_name":null,"funder_award_id":"CNS-0325353, CCF-0514058, IIS-0534531, CCF-083558, CCF-1115575","funder_id":"https://openalex.org/F4320337389","funder_display_name":"Division of Information and Intelligent Systems"},{"id":"https://openalex.org/G8952654028","display_name":null,"funder_award_id":"CNS-0325353, CCF-0514058, IIS-0534531, CCF-083558, CCF-1115575","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320307762","display_name":"International Business Machines Corporation","ror":"https://ror.org/05hh8d621"},{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"},{"id":"https://openalex.org/F4320337388","display_name":"Division of Computer and Network Systems","ror":"https://ror.org/02rdzmk74"},{"id":"https://openalex.org/F4320337389","display_name":"Division of Information and Intelligent Systems","ror":"https://ror.org/053a2cp42"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1480825842","https://openalex.org/W1528157682","https://openalex.org/W1563048602","https://openalex.org/W1963959263","https://openalex.org/W1971053635","https://openalex.org/W1991384316","https://openalex.org/W2048730512","https://openalex.org/W2054322995","https://openalex.org/W2068548282","https://openalex.org/W2129747980","https://openalex.org/W2152575945","https://openalex.org/W2162654297","https://openalex.org/W3111235649"],"related_works":["https://openalex.org/W2625359686","https://openalex.org/W2092108977","https://openalex.org/W2064017604","https://openalex.org/W2095518199","https://openalex.org/W2889114784","https://openalex.org/W2036784014","https://openalex.org/W2098754607","https://openalex.org/W2041764641","https://openalex.org/W2074193036","https://openalex.org/W2085269837"],"abstract_inverted_index":{"This":[0],"article":[1],"initiates":[2],"a":[3,38,102],"theoretical":[4],"investigation":[5],"into":[6],"online":[7],"scheduling":[8,48,87],"problems":[9],"with":[10],"speed":[11],"scaling":[12],"where":[13],"the":[14,21,51,58,66,90,94,98,106],"allowable":[15],"speeds":[16],"may":[17,24],"be":[18,25,54,93],"discrete,":[19],"and":[20,27,49,88],"power":[22,52,91],"function":[23],"arbitrary,":[26],"develops":[28],"algorithmic":[29],"analysis":[30],"techniques":[31],"for":[32,47,65,86,105],"this":[33],"setting.":[34],"We":[35,74],"show":[36,76],"that":[37,77],"natural":[39,79],"algorithm,":[40,80],"which":[41,81],"uses":[42,82],"Shortest":[43],"Remaining":[44],"Processing":[45],"Time":[46],"sets":[50,89],"to":[53,92],"one":[55],"more":[56],"than":[57],"number":[59],"of":[60,68,97,108],"unfinished":[61,99],"jobs,":[62,100],"is":[63,101],"3-competitive":[64],"objective":[67,107],"total":[69],"flow":[70,111],"time":[71,112],"plus":[72,113],"energy.":[73,114],"also":[75],"another":[78],"Highest":[83],"Density":[84],"First":[85],"fractional":[95,109],"weight":[96],"2-competitive":[103],"algorithm":[104],"weighted":[110]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":2},{"year":2018,"cited_by_count":4},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3}],"updated_date":"2026-04-13T07:58:08.660418","created_date":"2025-10-10T00:00:00"}