{"id":"https://openalex.org/W4281768490","doi":"https://doi.org/10.1145/3489048.3522627","title":"Competitive Algorithms for Online Multidimensional Knapsack Problems","display_name":"Competitive Algorithms for Online Multidimensional Knapsack Problems","publication_year":2022,"publication_date":"2022-06-02","ids":{"openalex":"https://openalex.org/W4281768490","doi":"https://doi.org/10.1145/3489048.3522627"},"language":"en","primary_location":{"id":"doi:10.1145/3489048.3522627","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3489048.3522627","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstract Proceedings of the 2022 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","raw_type":"proceedings-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/A5103160491","display_name":"Lin Yang","orcid":"https://orcid.org/0000-0001-9056-0500"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Lin Yang","raw_affiliation_strings":["University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5081117972","display_name":"Ali Zeynali","orcid":"https://orcid.org/0009-0004-9008-4400"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ali Zeynali","raw_affiliation_strings":["University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5046146251","display_name":"Mohammad Hajiesmaili","orcid":"https://orcid.org/0000-0001-9278-2254"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Mohammad H. Hajiesmaili","raw_affiliation_strings":["University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5037538509","display_name":"Ramesh K. Sitaraman","orcid":"https://orcid.org/0000-0003-0558-6875"},"institutions":[{"id":"https://openalex.org/I10734018","display_name":"Akamai (United States)","ror":"https://ror.org/03tarb191","country_code":"US","type":"company","lineage":["https://openalex.org/I10734018"]},{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Ramesh K. Sitaraman","raw_affiliation_strings":["University of Massachusetts Amherst & Akamai Technologies, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst & Akamai Technologies, Amherst, MA, USA","institution_ids":["https://openalex.org/I10734018","https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036683370","display_name":"Don Towsley","orcid":"https://orcid.org/0000-0002-7808-7375"},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Don Towsley","raw_affiliation_strings":["University of Massachusetts Amherst, Amherst, MA, USA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts Amherst, Amherst, MA, USA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5103160491"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":0.1381,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.44894977,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"87","last_page":"88"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9998999834060669,"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.9998999834060669,"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/T11704","display_name":"Mobile Crowdsensing and Crowdsourcing","score":0.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1706","display_name":"Computer Science Applications"},"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.9968000054359436,"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/knapsack-problem","display_name":"Knapsack problem","score":0.9561032056808472},{"id":"https://openalex.org/keywords/competitive-analysis","display_name":"Competitive analysis","score":0.7403280138969421},{"id":"https://openalex.org/keywords/online-algorithm","display_name":"Online algorithm","score":0.5812785029411316},{"id":"https://openalex.org/keywords/continuous-knapsack-problem","display_name":"Continuous knapsack problem","score":0.5296642184257507},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.5241665840148926},{"id":"https://openalex.org/keywords/dimension","display_name":"Dimension (graph theory)","score":0.5010638236999512},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4623028337955475},{"id":"https://openalex.org/keywords/change-making-problem","display_name":"Change-making problem","score":0.42970794439315796},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.4268224537372589},{"id":"https://openalex.org/keywords/maximization","display_name":"Maximization","score":0.42047202587127686},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.41919419169425964},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.397357314825058},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.22440564632415771}],"concepts":[{"id":"https://openalex.org/C113138325","wikidata":"https://www.wikidata.org/wiki/Q864457","display_name":"Knapsack problem","level":2,"score":0.9561032056808472},{"id":"https://openalex.org/C102408133","wikidata":"https://www.wikidata.org/wiki/Q5156350","display_name":"Competitive analysis","level":3,"score":0.7403280138969421},{"id":"https://openalex.org/C196921405","wikidata":"https://www.wikidata.org/wiki/Q786431","display_name":"Online algorithm","level":2,"score":0.5812785029411316},{"id":"https://openalex.org/C94569963","wikidata":"https://www.wikidata.org/wiki/Q5165487","display_name":"Continuous knapsack problem","level":3,"score":0.5296642184257507},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5241665840148926},{"id":"https://openalex.org/C33676613","wikidata":"https://www.wikidata.org/wiki/Q13415176","display_name":"Dimension (graph theory)","level":2,"score":0.5010638236999512},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4623028337955475},{"id":"https://openalex.org/C17722475","wikidata":"https://www.wikidata.org/wiki/Q3406279","display_name":"Change-making problem","level":4,"score":0.42970794439315796},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.4268224537372589},{"id":"https://openalex.org/C2776330181","wikidata":"https://www.wikidata.org/wiki/Q18358244","display_name":"Maximization","level":2,"score":0.42047202587127686},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.41919419169425964},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.397357314825058},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.22440564632415771},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3489048.3522627","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3489048.3522627","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Abstract Proceedings of the 2022 ACM SIGMETRICS/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/8","score":0.6499999761581421,"display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":7,"referenced_works":["https://openalex.org/W1552828154","https://openalex.org/W2492279027","https://openalex.org/W3157782429","https://openalex.org/W3177131999","https://openalex.org/W4206478994","https://openalex.org/W4237922950","https://openalex.org/W4381747950"],"related_works":["https://openalex.org/W2005493932","https://openalex.org/W2889442766","https://openalex.org/W2168163332","https://openalex.org/W2378557713","https://openalex.org/W42170116","https://openalex.org/W2009443800","https://openalex.org/W2412614002","https://openalex.org/W4391992339","https://openalex.org/W3089449646","https://openalex.org/W2214256523"],"abstract_inverted_index":{"In":[0],"this":[1],"work,":[2],"we":[3],"study":[4],"the":[5,49,62,72,87,134,139,149,152,157,167,170,181,192],"online":[6,46,114,126,136],"multidimensional":[7],"knapsack":[8,17,75,90,154],"problem":[9,91],"(called":[10],"OMdKP)":[11],"in":[12,22,44,98],"which":[13],"there":[14],"is":[15,20,51,69,79,82,148,166],"a":[16,29,83,109,161,197],"whose":[18],"capacity":[19,73,155,159],"represented":[21],"m":[23],"dimensions,":[24],"each":[25],"dimension":[26,163],"could":[27],"have":[28],"different":[30,36],"capacity.":[31],"Then,":[32],"n":[33],"items":[34,56,68],"with":[35,92,187],"scalar":[37],"profit":[38,64],"values":[39],"and":[40,48,71,104,156,164,172],"m-dimensional":[41],"weights":[42],"arrive":[43],"an":[45,113,120],"manner":[47],"goal":[50],"to":[52,124,196],"admit":[53],"or":[54],"decline":[55],"upon":[57],"their":[58],"arrival":[59],"such":[60,96],"that":[61,118,133,180],"total":[63],"obtained":[65],"by":[66],"admitted":[67],"maximized":[70],"of":[74,86,142,184],"across":[76],"all":[77],"dimensions":[78],"respected.":[80],"This":[81],"natural":[84],"generalization":[85],"classic":[88],"single-dimension":[89],"several":[93],"relevant":[94],"applications":[95],"as":[97],"virtual":[99],"machine":[100],"allocation,":[101],"job":[102],"scheduling,":[103],"all-or-nothing":[105],"flow":[106],"maximization":[107],"over":[108,160],"graph.":[110],"We":[111,177],"develop":[112],"algorithm":[115,137,186],"for":[116],"OMdKP":[117],"uses":[119],"exponential":[121,188],"reservation":[122,189],"function":[123,190],"make":[125],"admission":[127],"decisions.":[128],"Our":[129],"competitive":[130,140,182],"analysis":[131],"shows":[132],"proposed":[135],"achieves":[138],"ratio":[141,150,168,183],"O(log":[143],"(\u0398":[144],"\u03b1)),":[145],"where":[146],"\u03b1":[147],"between":[151,169],"aggregate":[153],"minimum":[158,173],"single":[162],"\u03b8":[165],"maximum":[171],"item":[174],"unit":[175],"values.":[176],"also":[178],"show":[179],"our":[185],"matches":[191],"lower":[193],"bound":[194],"up":[195],"constant":[198],"factor.":[199]},"counts_by_year":[{"year":2023,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}