{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:47:57Z","timestamp":1772164077543,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":8,"publisher":"ACM","license":[{"start":{"date-parts":[[2022,6,6]],"date-time":"2022-06-06T00:00:00Z","timestamp":1654473600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2022,6,6]]},"DOI":"10.1145\/3489048.3522627","type":"proceedings-article","created":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T10:30:55Z","timestamp":1654165855000},"page":"87-88","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":1,"title":["Competitive Algorithms for Online Multidimensional Knapsack Problems"],"prefix":"10.1145","author":[{"given":"Lin","family":"Yang","sequence":"first","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ali","family":"Zeynali","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mohammad H.","family":"Hajiesmaili","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramesh K.","family":"Sitaraman","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst & Akamai Technologies, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Don","family":"Towsley","sequence":"additional","affiliation":[{"name":"University of Massachusetts Amherst, Amherst, MA, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2022,6,6]]},"reference":[{"key":"e_1_3_2_1_1_1","volume-title":"Online computation and competitive analysis","author":"Borodin Allan","unstructured":"Allan Borodin and Ran El-Yaniv . 2005. Online computation and competitive analysis . Cambridge University Press . Allan Borodin and Ran El-Yaniv. 2005. Online computation and competitive analysis. Cambridge University Press."},{"key":"e_1_3_2_1_2_1","volume-title":"The design of competitive online algorithms via a primal-dual approach","author":"Buchbinder Niv","unstructured":"Niv Buchbinder and Joseph Naor . 2009. The design of competitive online algorithms via a primal-dual approach . Now Publishers Inc . Niv Buchbinder and Joseph Naor. 2009. The design of competitive online algorithms via a primal-dual approach. Now Publishers Inc."},{"key":"e_1_3_2_1_3_1","volume-title":"Workshop on internet and network economics (WINE).","author":"Chakrabarty Deeparnab","year":"2008","unstructured":"Deeparnab Chakrabarty , Yunhong Zhou , and Rajan Lukose . 2008 . Online knapsack problems . In Workshop on internet and network economics (WINE). Deeparnab Chakrabarty, Yunhong Zhou, and Rajan Lukose. 2008. Online knapsack problems. In Workshop on internet and network economics (WINE)."},{"key":"e_1_3_2_1_4_1","volume-title":"NOMS 2016 - 2016 IEEE\/IFIP Network Operations and Management Symposium. 1003--1004","author":"Paris S.","unstructured":"S. Paris , J. Leguay , L. Maggi , M. Draief , and S. Chouvardas . 2016. Online experts for admission control in SDN . In NOMS 2016 - 2016 IEEE\/IFIP Network Operations and Management Symposium. 1003--1004 . S. Paris, J. Leguay, L. Maggi, M. Draief, and S. Chouvardas. 2016. Online experts for admission control in SDN. In NOMS 2016 - 2016 IEEE\/IFIP Network Operations and Management Symposium. 1003--1004."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/3449193"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17294"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1109\/INFOCOM.2016.7524430"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-92185-1_63"}],"event":{"name":"SIGMETRICS\/PERFORMANCE '22: ACM SIGMETRICS\/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems","location":"Mumbai India","acronym":"SIGMETRICS\/PERFORMANCE '22","sponsor":["SIGMETRICS ACM Special Interest Group on Measurement and Evaluation"]},"container-title":["Abstract Proceedings of the 2022 ACM SIGMETRICS\/IFIP PERFORMANCE Joint International Conference on Measurement and Modeling of Computer Systems"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489048.3522627","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3489048.3522627","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T16:49:00Z","timestamp":1750178940000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3489048.3522627"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,6]]},"references-count":8,"alternative-id":["10.1145\/3489048.3522627","10.1145\/3489048"],"URL":"https:\/\/doi.org\/10.1145\/3489048.3522627","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/3547353.3522627","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2022,6,6]]},"assertion":[{"value":"2022-06-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}