{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T21:28:59Z","timestamp":1742938139889,"version":"3.40.3"},"publisher-location":"Cham","reference-count":16,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031498145"},{"type":"electronic","value":"9783031498152"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-49815-2_4","type":"book-chapter","created":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:02:28Z","timestamp":1703142148000},"page":"45-58","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Deterministic Algorithm for\u00a0the\u00a0Online Min-Sum Set Cover Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0009-0009-0210-6451","authenticated-orcid":false,"given":"Mateusz","family":"Basiak","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2453-7772","authenticated-orcid":false,"given":"Marcin","family":"Bienkowski","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0008-3849-9165","authenticated-orcid":false,"given":"Agnieszka","family":"Tatarczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,12,22]]},"reference":[{"issue":"2","key":"4_CR1","doi-asserted-by":"publisher","first-page":"11","DOI":"10.1145\/3308774.3308778","volume":"52","author":"E Agichtein","year":"2018","unstructured":"Agichtein, E., Brill, E., Dumais, S.T.: Improving web search ranking by incorporating user behavior information. SIGIR Forum 52(2), 11\u201318 (2018). https:\/\/doi.org\/10.1145\/3308774.3308778","journal-title":"SIGIR Forum"},{"issue":"1","key":"4_CR2","doi-asserted-by":"publisher","first-page":"121","DOI":"10.4086\/toc.2012.v008a006","volume":"8","author":"S Arora","year":"2012","unstructured":"Arora, S., Hazan, E., Kale, S.: The multiplicative weights update method: a meta-algorithm and applications. Theory Comput. Syst. 8(1), 121\u2013164 (2012). https:\/\/doi.org\/10.4086\/toc.2012.v008a006","journal-title":"Theory Comput. Syst."},{"key":"4_CR3","doi-asserted-by":"publisher","unstructured":"Bansal, N., Batra, J., Farhadi, M., Tetali, P.: Improved approximations for min sum vertex cover and generalized min sum set cover. In: Proceedings of the ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 998\u20131005. SIAM (2021). https:\/\/doi.org\/10.1137\/1.9781611976465.62","DOI":"10.1137\/1.9781611976465.62"},{"issue":"2","key":"4_CR4","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1006\/inco.1997.2677","volume":"140","author":"A Bar-Noy","year":"1998","unstructured":"Bar-Noy, A., Bellare, M., Halld\u00f3rsson, M.M., Shachnai, H., Tamir, T.: On chromatic sums and distributed resource allocation. Inf. Comput. 140(2), 183\u2013202 (1998). https:\/\/doi.org\/10.1006\/inco.1997.2677","journal-title":"Inf. Comput."},{"issue":"1","key":"4_CR5","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/BF01294260","volume":"11","author":"S Ben-David","year":"1994","unstructured":"Ben-David, S., Borodin, A., Karp, R.M., Tardos, G., Wigderson, A.: On the power of randomization in online algorithms. Algorithmica 11(1), 2\u201314 (1994). https:\/\/doi.org\/10.1007\/BF01294260","journal-title":"Algorithmica"},{"key":"4_CR6","doi-asserted-by":"publisher","unstructured":"Bienkowski, M., Mucha, M.: An improved algorithm for online reranking. In: Proceedings of the 37th AAAI Conference on Artificial Intelligence, pp. 6815\u20136822 (2023). https:\/\/doi.org\/10.1609\/aaai.v37i6.25835","DOI":"10.1609\/aaai.v37i6.25835"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1023\/A:1007621832648","volume":"39","author":"A Blum","year":"2000","unstructured":"Blum, A., Burch, C.: On-line learning and the metrical task system problem. Mach. Learn. 39(1), 35\u201358 (2000). https:\/\/doi.org\/10.1023\/A:1007621832648","journal-title":"Mach. Learn."},{"key":"4_CR8","volume-title":"Online Computation and Competitive Analysis","author":"A Borodin","year":"1998","unstructured":"Borodin, A., El-Yaniv, R.: Online Computation and Competitive Analysis. Cambridge University Press, Cambridge (1998)"},{"key":"4_CR9","doi-asserted-by":"publisher","unstructured":"Derakhshan, M., Golrezaei, N., Manshadi, V.H., Mirrokni, V.S.: Product ranking on online platforms. In: Proceedings of the 21st ACM Conference on Economics and Computation (EC), p. 459. ACM (2020). https:\/\/doi.org\/10.1145\/3391403.3399483","DOI":"10.1145\/3391403.3399483"},{"key":"4_CR10","doi-asserted-by":"publisher","unstructured":"Dwork, C., Kumar, R., Naor, M., Sivakumar, D.: Rank aggregation methods for the web. In: Proceedings of the 10th International World Wide Web Conference (WWW), pp. 613\u2013622. ACM (2001). https:\/\/doi.org\/10.1145\/371920.372165","DOI":"10.1145\/371920.372165"},{"issue":"4","key":"4_CR11","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s00453-004-1110-5","volume":"40","author":"U Feige","year":"2004","unstructured":"Feige, U., Lov\u00e1sz, L., Tetali, P.: Approximating min sum set cover. Algorithmica 40(4), 219\u2013234 (2004). https:\/\/doi.org\/10.1007\/s00453-004-1110-5","journal-title":"Algorithmica"},{"key":"4_CR12","doi-asserted-by":"publisher","unstructured":"Fotakis, D., Kavouras, L., Koumoutsos, G., Skoulakis, S., Vardas, M.: The online min-sum set cover problem. In: Proceedings of the 47th International Colloquium on Automata, Languages and Programming (ICALP), pp. 51:1\u201351:16 (2020). https:\/\/doi.org\/10.4230\/LIPIcs.ICALP.2020.51","DOI":"10.4230\/LIPIcs.ICALP.2020.51"},{"key":"4_CR13","unstructured":"Fotakis, D., Lianeas, T., Piliouras, G., Skoulakis, S.: Efficient online learning of optimal rankings: Dimensionality reduction via gradient descent. In: Proceedings of the 33rd Annual Conference on Neural Information Processing Systems (NeurIPS), pp. 7816\u20137827 (2020)"},{"key":"4_CR14","doi-asserted-by":"publisher","first-page":"1448","DOI":"10.1007\/978-1-4939-2864-4_266","volume-title":"Encyclopedia of Algorithms","author":"S Kamali","year":"2016","unstructured":"Kamali, S.: Online list update. In: Kao, M.Y. (ed.) Encyclopedia of Algorithms, pp. 1448\u20131451. Springer, New York (2016). https:\/\/doi.org\/10.1007\/978-1-4939-2864-4_266"},{"issue":"2","key":"4_CR15","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Inf. Comput. 108(2), 212\u2013261 (1994). https:\/\/doi.org\/10.1006\/inco.1994.1009","journal-title":"Inf. Comput."},{"issue":"2","key":"4_CR16","doi-asserted-by":"publisher","first-page":"202","DOI":"10.1145\/2786.2793","volume":"28","author":"DD Sleator","year":"1985","unstructured":"Sleator, D.D., Tarjan, R.E.: Amortized efficiency of list update and paging rules. Commun. ACM 28(2), 202\u2013208 (1985). https:\/\/doi.org\/10.1145\/2786.2793","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Computer Science","Approximation and Online Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-49815-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,12,21]],"date-time":"2023-12-21T07:02:49Z","timestamp":1703142169000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-49815-2_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031498145","9783031498152"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-49815-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"22 December 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WAOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Approximation and Online Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Amsterdam","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"waoa2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/algo-conference.org\/2023\/waoa\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"43","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"37% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.05","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7.7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}