{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,13]],"date-time":"2026-02-13T04:18:50Z","timestamp":1770956330223,"version":"3.50.1"},"reference-count":65,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2024]]},"DOI":"10.1109\/access.2024.3504541","type":"journal-article","created":{"date-parts":[[2024,11,22]],"date-time":"2024-11-22T19:05:57Z","timestamp":1732302357000},"page":"174723-174739","source":"Crossref","is-referenced-by-count":3,"title":["Revisiting Online Algorithms: A Survey of Set Cover Solutions Beyond Competitive Analysis"],"prefix":"10.1109","volume":"12","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2689-4412","authenticated-orcid":false,"given":"Christine","family":"Markarian","sequence":"first","affiliation":[{"name":"College of Engineering and Information Technology, University of Dubai, Dubai, United Arab Emirates"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2863-4817","authenticated-orcid":false,"given":"Claude","family":"Fachkha","sequence":"additional","affiliation":[{"name":"College of Engineering and Information Technology, University of Dubai, Dubai, United Arab Emirates"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-8994-5427","authenticated-orcid":false,"given":"Noura","family":"Yassine","sequence":"additional","affiliation":[{"name":"Mathematics and Computer Science Department, Faculty of Science, Beirut Arab University, Beirut, Lebanon"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"issue":"1","key":"ref1","doi-asserted-by":"crossref","first-page":"353","DOI":"10.1023\/A:1019225027893","article-title":"Algorithms for the set covering problem","volume":"98","author":"Caprara","year":"2000","journal-title":"Ann. Oper. Res."},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/285055.285059"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-004-1110-5"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/237814.237991"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/trsc.7.1.34"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/inte.1120.0671"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1137\/130911317"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/j.asoc.2018.10.025"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1007\/s10878-015-9915-5"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/780542.780558"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/s00454-006-1273-8"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258599"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1145\/3055399.3055493"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1007\/11775096_23"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1287\/moor.4.3.233"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/0012-365X(75)90058-8"},{"key":"ref17","volume-title":"Online Computation and Competitive Analysis","author":"Borodin","year":"2005"},{"key":"ref18","volume-title":"Survey of Approximation Algorithms for Set Cover Problem","author":"Dutta","year":"2009"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1145\/238061.238163"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1006\/inco.1994.1009"},{"key":"ref21","first-page":"34","article-title":"On the use of randomization in the online set cover problem","volume":"2","author":"Korman","year":"2004","journal-title":"Weizmann Inst. Sci."},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1977.24"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1080.0363"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539793242618"},{"issue":"1","key":"ref25","first-page":"36","article-title":"Greedy algorithms for on-line set-covering","volume":"4","author":"Ausiello","year":"2009","journal-title":"Algorithmic Oper. Res."},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10107-003-0436-0"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1145\/2786.2793"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539795288490"},{"issue":"4","key":"ref29","first-page":"1402","article-title":"Online scheduling with generalized due dates","volume":"45","author":"Im","year":"2016","journal-title":"SIAM J. Comput."},{"key":"ref30","first-page":"322","article-title":"Competitive algorithms for server problems","volume-title":"Proc. 20th Annu. ACM Symp. Theory Comput.","author":"Manasse"},{"key":"ref31","first-page":"1","article-title":"Pick, pack, and survive: Charging robots in a modern warehouse based on online connected dominating sets","volume-title":"Proc. 9th Int. Conf. Fun Algorithms (FUN)","author":"Hamann"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21398-9_22"},{"key":"ref33","first-page":"214","article-title":"An optimal algorithm for online prize-collecting node-weighted","volume-title":"Proc. 29th Int. Workshop Combinat. Algorithms (IWOCA)","volume":"10979","author":"Forest"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-71147-8_2"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.5220\/0007369500002104"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2008.31"},{"key":"ref37","first-page":"1","article-title":"Greedy algorithms for online survivable network design","volume-title":"Proc. 45th Int. Colloq. Automata, Lang., Program. (ICALP 2018)","author":"Dehghani"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS52979.2021.00122"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00841-8"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00844-5"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-021-00801-2"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2017.05.029"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611973099.52"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1145\/1806689.1806772"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1145\/3056461"},{"issue":"1","key":"ref46","first-page":"31","article-title":"Semi-online algorithms for load balancing on identical machines","volume":"70","author":"Kellerer","year":"1999","journal-title":"Inf. Process. Lett."},{"issue":"50","key":"ref47","first-page":"7051","article-title":"Semi-online algorithms for bin packing on a server with advice","volume":"412","author":"Epstein","year":"2011","journal-title":"Theor. Comput. Sci."},{"key":"ref48","first-page":"20083","article-title":"The primal-dual method for learning augmented algorithms","volume-title":"Proc. NIPS","author":"Bamas"},{"key":"ref49","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i12.17294"},{"key":"ref50","first-page":"582","article-title":"Online algorithms with multiple predictions","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Anand"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1145\/3582689"},{"key":"ref52","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611977073.4"},{"key":"ref53","doi-asserted-by":"publisher","DOI":"10.1145\/3548774"},{"key":"ref54","doi-asserted-by":"publisher","DOI":"10.1145\/3447579"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975994.112"},{"key":"ref56","first-page":"46","article-title":"Online and dynamic algorithms for geometric set cover and hitting set","volume-title":"Proc. 39th Int. Symp. Comput. Geometry (SoCG 2023)","volume":"258","author":"Khan"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/ACCESS.2024.3406788"},{"key":"ref58","doi-asserted-by":"publisher","DOI":"10.5220\/0010469207370743"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1201\/9780429096280"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1007\/s11590-019-01428-7"},{"key":"ref61","doi-asserted-by":"publisher","DOI":"10.1007\/978-81-322-3972-7"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1145\/3450494"},{"key":"ref63","article-title":"Online algorithms with randomly infused advice","author":"Emek","year":"2023","journal-title":"arXiv:2302.05366"},{"key":"ref64","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref65","first-page":"33","article-title":"Dynamic resource allocation in cloud computing: A survey","volume":"103","author":"Sharma","year":"2020","journal-title":"J. Netw. Comput. Appl."}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/6287639\/10380310\/10765974.pdf?arnumber=10765974","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,29]],"date-time":"2024-11-29T07:38:00Z","timestamp":1732865880000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10765974\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"references-count":65,"URL":"https:\/\/doi.org\/10.1109\/access.2024.3504541","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2024]]}}}