{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,3]],"date-time":"2026-02-03T17:36:38Z","timestamp":1770140198008,"version":"3.49.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031372278","type":"print"},{"value":"9783031372285","type":"electronic"}],"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-37228-5_8","type":"book-chapter","created":{"date-parts":[[2023,7,6]],"date-time":"2023-07-06T09:02:55Z","timestamp":1688634175000},"page":"124-134","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Online Variant of\u00a0Set Cover Inspired by\u00a0Happy Clients"],"prefix":"10.1007","author":[{"given":"Christine","family":"Markarian","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,7,7]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"Abshoff, S., Kling, P., Markarian, C., Meyerauf der Heide, F., Pietrzyk, P.: Towards the price of leasing online. J. Comb. Optim. 32(4), 1197\u20131216 (2016)","DOI":"10.1007\/s10878-015-9915-5"},{"issue":"2","key":"8_CR2","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1137\/060661946","volume":"39","author":"N Alon","year":"2009","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: The online set cover problem. SIAM J. Comput. 39(2), 361\u2013370 (2009)","journal-title":"SIAM J. Comput."},{"key":"8_CR3","doi-asserted-by":"crossref","unstructured":"Alon, N., Azar, Y., Gutner, S.: Admission control to minimize rejections and online set cover with repetitions. In: Proceedings of the Seventeenth Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 238\u2013244 (2005)","DOI":"10.1145\/1073970.1074010"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-540-72792-7_32","volume-title":"Integer Programming and Combinatorial Optimization","author":"BM Anthony","year":"2007","unstructured":"Anthony, B.M., Gupta, A.: Infrastructure leasing problems. In: Fischetti, M., Williamson, D.P. (eds.) IPCO 2007. LNCS, vol. 4513, pp. 424\u2013438. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-72792-7_32"},{"key":"8_CR5","unstructured":"Bhawalkar, K., Gollapudi, S., Panigrahi, D.: Online set cover with set requests. In: Klaus J., Rolim, J.D.P., Devanur, N.R., Moore, C. (eds.) Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques (APPROX\/RANDOM 2014), vol. 28 of Leibniz International Proceedings in Informatics (LIPIcs), Dagstuhl, Germany, pp. 64\u201379. Schloss Dagstuhl-Leibniz-Zentrum fuer Informatik (2014)"},{"key":"8_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-62127-2_15","volume-title":"Algorithms and Data Structures","author":"M Bienkowski","year":"2017","unstructured":"Bienkowski, M., Kraska, A., Schmidt, P.: A deterministic algorithm for online steiner tree leasing. In: WADS 2017. LNCS, vol. 10389, pp. 169\u2013180. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-62127-2_15"},{"issue":"2","key":"8_CR7","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1287\/moor.1080.0363","volume":"34","author":"N Buchbinder","year":"2009","unstructured":"Buchbinder, N., Naor, J.: Online primal-dual algorithms for covering and packing. Math. Oper. Res. 34(2), 270\u2013286 (2009)","journal-title":"Math. Oper. Res."},{"key":"8_CR8","doi-asserted-by":"publisher","first-page":"353","DOI":"10.1023\/A:1019225027893","volume":"98","author":"A Caprara","year":"2000","unstructured":"Caprara, A., Toth, P., Fischetti, M.: Algorithms for the set covering problem. Ann. Oper. Res. 98, 353\u2013371 (2000)","journal-title":"Ann. Oper. Res."},{"issue":"4","key":"8_CR9","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. J. ACM (JACM) 45(4), 634\u2013652 (1998)","journal-title":"J. ACM (JACM)"},{"issue":"4","key":"8_CR10","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)","journal-title":"Algorithmica"},{"key":"8_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-71147-8_2","volume-title":"Combinatorial Optimization and Applications","author":"B Feldkord","year":"2017","unstructured":"Feldkord, B., Markarian, C., Meyer Auf der Heide, F.: Price fluctuation in online leasing. In: Gao, X., Du, H., Han, M. (eds.) COCOA 2017. LNCS, vol. 10628, pp. 17\u201331. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-71147-8_2"},{"key":"8_CR12","unstructured":"Korman, S.: On the use of randomization in the online set cover problem. Weizmann Inst. Sci. 2 (2004)"},{"key":"8_CR13","doi-asserted-by":"crossref","unstructured":"Li, S., Markarian, C., auf der Heide, F.M.: Towards flexible demands in online leasing problems. Algorithmica 80(5), 1556\u20131574 (2018)","DOI":"10.1007\/s00453-018-0420-y"},{"key":"8_CR14","series-title":"Operations Research Proceedings","doi-asserted-by":"publisher","first-page":"429","DOI":"10.1007\/978-3-319-89920-6_57","volume-title":"Operations Research Proceedings 2017","author":"C Markarian","year":"2018","unstructured":"Markarian, C.: Leasing with uncertainty. In: Kliewer, N., Ehmke, J.F., Bornd\u00f6rfer, R. (eds.) Operations Research Proceedings 2017. ORP, pp. 429\u2013434. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-89920-6_57"},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"Markarian, C.: Online non-metric facility location with service installation costs. In: Filipe, J., Smialek, M., Brodsky, A., Hammoudi, S. (eds.) Proceedings of the 23rd International Conference on Enterprise Information Systems, ICEIS 2021, Online Streaming, 26\u201328 April 2021, vol. 1, pp. 737\u2013743. SCITEPRESS (2021)","DOI":"10.5220\/0010469207370743"},{"key":"8_CR16","doi-asserted-by":"crossref","unstructured":"Markarian, C.: Online set cover with happiness costs. In: Panetto, H., Macchi, M., Madani, K. (eds.) Proceedings of the 2nd International Conference on Innovative Intelligent Industrial Production and Logistics, IN4PL 2021, 25\u201327 October 2021, pp. 40\u201345. SCITEPRESS (2021)","DOI":"10.5220\/0010738300003062"},{"key":"8_CR17","doi-asserted-by":"crossref","unstructured":"Markarian, C., auf der Heide, F.M.: Online algorithms for leasing vertex cover and leasing non-metric facility location. In: Parlier, G.H., Liberatore, F., Demange, M. (eds.) Proceedings of the 8th International Conference on Operations Research and Enterprise Systems, ICORES 2019, Prague, Czech Republic, 19\u201321 February 2019, pp. 315\u2013321. SciTePress (2019)","DOI":"10.5220\/0007369503150321"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Markarian, C., Kassar, A.-N.: Online deterministic algorithms for connected dominating set & set cover leasing problems. In: ICORES, pp. 121\u2013128 (2020)","DOI":"10.5220\/0008866701210128"},{"key":"8_CR19","doi-asserted-by":"crossref","unstructured":"Markarian, C., Khallouf, P.: Online facility service leasing inspired by the covid-19 pandemic. In: 18th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2021, pp. 195\u2013202 (2021)","DOI":"10.5220\/0010572601950202"},{"key":"8_CR20","doi-asserted-by":"crossref","unstructured":"Markarian, C., Khallouf, P.: Online facility service leasing inspired by the COVID-19 pandemic. In: Gusikhin, O., Nijmeijer, H., Madani, K. (eds.) Proceedings of the 18th International Conference on Informatics in Control, Automation and Robotics, ICINCO 2021, Online Streaming, 6\u20138 July 2021, pp. 195\u2013202. SCITEPRESS (2021)","DOI":"10.5220\/0010572601950202"},{"key":"8_CR21","doi-asserted-by":"crossref","unstructured":"Meyerson, A.: The parking permit problem. In: 46th Annual IEEE Symposium on Foundations of Computer Science (FOCS 2005), pp. 274\u2013282. IEEE (2005)","DOI":"10.1109\/SFCS.2005.72"},{"issue":"4","key":"8_CR22","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1016\/j.disopt.2013.10.001","volume":"10","author":"C Nagarajan","year":"2013","unstructured":"Nagarajan, C., Williamson, D.P.: Offline and online facility leasing. Disc. Optim. 10(4), 361\u2013370 (2013)","journal-title":"Disc. Optim."},{"key":"8_CR23","unstructured":"de Lima, M.S., San Felice, M.C., Lee, O.: Connected facility leasing problems. In: ICTCS\/CILC, pp. 162\u2013173 (2017)"},{"key":"8_CR24","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1016\/j.endm.2017.10.039","volume":"62","author":"MS de Lima","year":"2017","unstructured":"de Lima, M.S., San Felice, M.C., Lee, O.: On generalizations of the parking permit problem and network leasing problems. Electron. Notes Disc. Math. 62, 225\u2013230 (2017)","journal-title":"Electron. Notes Disc. Math."},{"issue":"2","key":"8_CR25","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1006\/jagm.1997.0887","volume":"25","author":"P Slav\u0131k","year":"1997","unstructured":"Slav\u0131k, P.: A tight analysis of the greedy algorithm for set cover. J. Algor. 25(2), 237\u2013254 (1997)","journal-title":"J. Algor."},{"key":"8_CR26","doi-asserted-by":"publisher","unstructured":"Vemuganti, R.R.: Applications of Set Covering, Set Packing and Set Partitioning Models: A Survey, pp. 573\u2013746. Springer, Boston (1998). https:\/\/doi.org\/10.1007\/978-1-4613-0303-9_9","DOI":"10.1007\/978-1-4613-0303-9_9"}],"container-title":["Communications in Computer and Information Science","Innovative Intelligent Industrial Production and Logistics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-37228-5_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,23]],"date-time":"2024-10-23T19:01:29Z","timestamp":1729710089000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-37228-5_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031372278","9783031372285"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-37228-5_8","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"7 July 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IN4PL","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Innovative Intelligent Industrial Production and Logistics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 October 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"in4pl2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/in4pl.scitevents.org\/?y=2021","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":"PRIMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","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":"4","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":"10","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":"15% - 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","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":"4","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}