{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T09:53:23Z","timestamp":1743069203312,"version":"3.40.3"},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031089640"},{"type":"electronic","value":"9783031089657"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-08965-7_9","type":"book-chapter","created":{"date-parts":[[2022,7,7]],"date-time":"2022-07-07T16:03:57Z","timestamp":1657209837000},"page":"168-183","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Online Algorithms for\u00a0Prize-Collecting Optimization Problems"],"prefix":"10.1007","author":[{"given":"Christine","family":"Markarian","sequence":"first","affiliation":[]},{"given":"Abdul Nasser","family":"El-Kassar","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,7,8]]},"reference":[{"issue":"4","key":"9_CR1","doi-asserted-by":"publisher","first-page":"1197","DOI":"10.1007\/s10878-015-9915-5","volume":"32","author":"S Abshoff","year":"2016","unstructured":"Abshoff, S., Kling, P., Markarian, C., auf der Heide, F.M., Pietrzyk, P.: Towards the price of leasing online. J. Comb. Optim. 32(4), 1197\u20131216 (2016)","journal-title":"J. Comb. Optim."},{"key":"9_CR2","doi-asserted-by":"crossref","unstructured":"Alon, N., Awerbuch, B., Azar, Y.: The online set cover problem. In: Proceedings of the Thirty-fifth Annual ACM Symposium on Theory of Computing, STOC 2003, pp. 100\u2013105. ACM, New York (2003)","DOI":"10.1145\/780542.780558"},{"issue":"4","key":"9_CR3","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1145\/1198513.1198522","volume":"2","author":"N Alon","year":"2006","unstructured":"Alon, N., Awerbuch, B., Azar, Y., Buchbinder, N., Naor, J.S.: A general approach to online network optimization problems. ACM Trans. Algorithms 2(4), 640\u2013660 (2006)","journal-title":"ACM Trans. Algorithms"},{"key":"9_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1007\/11830924_3","volume-title":"Approximation, Randomization, and Combinatorial Optimization. Algorithms and Techniques","author":"C Amb\u00fchl","year":"2006","unstructured":"Amb\u00fchl, C., Erlebach, T., Mihal\u00e1k, M., Nunkesser, M.: Constant-factor approximation for minimum-weight (connected) dominating sets in unit disk graphs. In: D\u00edaz, J., Jansen, K., Rolim, J.D.P., Zwick, U. (eds.) APPROX\/RANDOM -2006. LNCS, vol. 4110, pp. 3\u201314. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11830924_3"},{"issue":"6","key":"9_CR5","doi-asserted-by":"publisher","first-page":"1413","DOI":"10.1007\/s00224-019-09922-2","volume":"63","author":"S Angelopoulos","year":"2019","unstructured":"Angelopoulos, S.: Parameterized analysis of the online priority and node-weighted steiner tree problems. Theory Comput. Syst. 63(6), 1413\u20131447 (2019)","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"9_CR6","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1016\/j.ipl.2008.03.002","volume":"107","author":"G Ausiello","year":"2008","unstructured":"Ausiello, G., Bonifaci, V., Laura, L.: The online prize-collecting traveling salesman problem. Inf. Process. Lett. 107(6), 199\u2013204 (2008)","journal-title":"Inf. Process. Lett."},{"key":"9_CR7","doi-asserted-by":"publisher","first-page":"413","DOI":"10.1007\/BF01581256","volume":"59","author":"D Bienstock","year":"1993","unstructured":"Bienstock, D., Goemans, M., Simchi-levi, D., Williamson, D.: Note on the prize collecting traveling salesman problem. Math. Program. 59, 413\u2013420 (1993)","journal-title":"Math. Program."},{"key":"9_CR8","unstructured":"Cheung, S.S.: Offline and online facility location and network design. Ph.D. thesis, Operations Research and Information Engineering, Cornell University (2016)"},{"key":"9_CR9","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 Discrete Math. 62, 225\u2013230 (2017)","journal-title":"Electron. Notes Discrete Math."},{"key":"9_CR10","doi-asserted-by":"publisher","first-page":"172","DOI":"10.1016\/j.dam.2019.05.013","volume":"281","author":"MS De Lima","year":"2020","unstructured":"De Lima, M.S., SanFelice, M.C., Lee, O.: Group parking permit problems. Discrete Appl. Math. 281, 172\u2013194 (2020)","journal-title":"Discrete Appl. Math."},{"issue":"1","key":"9_CR11","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1016\/j.tcs.2004.08.015","volume":"332","author":"M Demange","year":"2005","unstructured":"Demange, M., Paschos, V.T.: Online vertex-covering. Theoret. Comput. Sci. 332(1), 83\u2013108 (2005)","journal-title":"Theoret. Comput. Sci."},{"key":"9_CR12","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":"9_CR13","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.endm.2015.07.026","volume":"50","author":"MCS Felice","year":"2015","unstructured":"Felice, M.C.S., Cheung, S.-S., Lee, O., Williamson, D.P.: The online prize-collecting facility location problem. Electron. Notes Discrete Math. 50, 151\u2013156 (2015). LAGOS\u201915 - VIII Latin-American Algorithms, Graphs and Optimization Symposium","journal-title":"Electron. Notes Discrete Math."},{"key":"9_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"138","DOI":"10.1007\/11775096_14","volume-title":"Algorithmic Aspects in Information and Management","author":"R Fleischer","year":"2006","unstructured":"Fleischer, R., Li, J., Tian, S., Zhu, H.: Non-metric multicommodity and multilevel facility location. In: Cheng, S.-W., Poon, C.K. (eds.) AAIM 2006. LNCS, vol. 4041, pp. 138\u2013148. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11775096_14"},{"issue":"1","key":"9_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00453-007-9049-y","volume":"50","author":"D Fotakis","year":"2008","unstructured":"Fotakis, D.: On the competitive ratio for online facility location. Algorithmica 50(1), 1\u201357 (2008)","journal-title":"Algorithmica"},{"issue":"2","key":"9_CR16","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1137\/S0097539793242618","volume":"24","author":"MX Goemans","year":"1995","unstructured":"Goemans, M.X., Williamson, D.P.: A general approximation technique for constrained forest problems. SIAM J. Comput. 24(2), 296\u2013317 (1995)","journal-title":"SIAM J. Comput."},{"key":"9_CR17","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20, 374\u2013387 (1998)","journal-title":"Algorithmica"},{"issue":"4","key":"9_CR18","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/PL00009201","volume":"20","author":"S Guha","year":"1998","unstructured":"Guha, S., Khuller, S.: Approximation algorithms for connected dominating sets. Algorithmica 20(4), 374\u2013387 (1998)","journal-title":"Algorithmica"},{"key":"9_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"576","DOI":"10.1007\/978-3-662-43948-7_48","volume-title":"Automata, Languages, and Programming","author":"MT Hajiaghayi","year":"2014","unstructured":"Hajiaghayi, M.T., Liaghat, V., Panigrahi, D.: Near-optimal online algorithms for prize-collecting steiner problems. In: Esparza, J., Fraigniaud, P., Husfeldt, T., Koutsoupias, E. (eds.) ICALP 2014. LNCS, vol. 8572, pp. 576\u2013587. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-662-43948-7_48"},{"key":"9_CR20","doi-asserted-by":"crossref","unstructured":"Hajiaghayi, M.T., Liaghat, V., Panigrahi, D.: Online node-weighted Steiner forest and extensions via disk paintings. In: 54th Annual IEEE Symposium on Foundations of Computer Science, FOCS 2013, 26\u201329 October 2013, Berkeley, CA, USA, pp. 558\u2013567 (2013)","DOI":"10.1109\/FOCS.2013.66"},{"key":"9_CR21","unstructured":"Hamann, H., Markarian, C., Meyer auf der Heide, F., Wahby, M.: Pick, pack, & survive: charging robots in a modern warehouse based on online connected dominating sets. In: 9th International Conference on Fun with Algorithms, FUN 2018, 13\u201315 June 2018, La Maddalena, Italy, pp. 22:1\u201322:13 (2018)"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Hidayati, S.C., Hua, K.-L., Tsao, Y., Shuai, H.-H., Liu, J., Cheng, W.-H.: Garment detectives: discovering clothes and its genre in consumer photos. In: 2019 IEEE Conference on Multimedia Information Processing and Retrieval (MIPR), pp. 471\u2013474 (2019)","DOI":"10.1109\/MIPR.2019.00095"},{"issue":"Suppl 1","key":"9_CR23","doi-asserted-by":"publisher","first-page":"S233","DOI":"10.1093\/bioinformatics\/18.suppl_1.S233","volume":"18","author":"T Ideker","year":"2002","unstructured":"Ideker, T., Ozier, O., Schwikowski, B., Siegel, A.: Discovering regulatory and signalling circuits in molecular interaction networks. Bioinformatics 18(Suppl 1), S233-40 (2002)","journal-title":"Bioinformatics"},{"issue":"2","key":"9_CR24","first-page":"120","volume":"41","author":"D JunFeng","year":"2014","unstructured":"JunFeng, D., JianHua, T.: A factor 2-approximation algorithm for the prize-collecting vertex cover problem. J. Beijing Univ. Chem. Technol. (Nat. Sci. Edn.) 41(2), 120 (2014)","journal-title":"J. Beijing Univ. Chem. Technol. (Nat. Sci. Edn.)"},{"key":"9_CR25","unstructured":"Korman, S.: On the use of randomization in the online set cover problem. Master\u2019s thesis, Weizmann Institute of Science, Israel (2005)"},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Li, S., Markarian, C., Meyer auf der Heide, F.: Towards flexible demands in online leasing problems. Algorithmica 80(5), 1556\u20131574 (2018)","DOI":"10.1007\/s00453-018-0420-y"},{"key":"9_CR27","unstructured":"Ljubic, I.: Exact and memetic algorithms for two network design problems. Master\u2019s thesis, Vienna University of Technology, Vienna (2004)"},{"key":"9_CR28","unstructured":"Ljubic, I., Weiskircher, R., Pferschy, U., Klau, G., Mutzel, P., Fischetti, M.: Solving the prize-collecting steiner tree problem to optimality, pp. 68\u201376, January 2005"},{"key":"9_CR29","doi-asserted-by":"crossref","unstructured":"Mahdian, M., Yan, Q.: Online bipartite matching with random arrivals: an approach based on strongly factor-revealing LPS. In: Proceedings of the Forty-Third Annual ACM Symposium on Theory of Computing, STOC 2011, pp. 597\u2013606. Association for Computing Machinery, New York (2011)","DOI":"10.1145\/1993636.1993716"},{"key":"9_CR30","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1287\/moor.1120.0551","volume":"37","author":"VH Manshadi","year":"2010","unstructured":"Manshadi, V.H., Gharan, S.O., Saberi, A.: Online stochastic matching: online actions based on offline statistics. Math. Oper. Res. 37, 559\u2013573 (2010)","journal-title":"Math. Oper. Res."},{"key":"9_CR31","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":"9_CR32","doi-asserted-by":"crossref","unstructured":"Markarian, C.: An optimal algorithm for online prize-collecting node-weighted steiner forest. In: Proceedings of Combinatorial Algorithms - 29th International Workshop, IWOCA 2018, Singapore, 16\u201319 July 2018, pp. 214\u2013223 (2018)","DOI":"10.1007\/978-3-319-94667-2_18"},{"key":"9_CR33","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":"9_CR34","doi-asserted-by":"crossref","unstructured":"Markarian, C., El-Kassar, A.N.: Algorithmic view of online prize-collecting optimization problems. 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. 744\u2013751. SCITEPRESS (2021)","DOI":"10.5220\/0010471507440751"},{"key":"9_CR35","doi-asserted-by":"crossref","unstructured":"Markarian, C., Kassar, A.: Online deterministic algorithms for connected dominating set & set cover leasing problems. In: Parlier, G.H., Liberatore, F., Demange, M. (eds.) Proceedings of the 9th International Conference on Operations Research and Enterprise Systems, ICORES 2020, Valletta, Malta, 22\u201324 February 2020, pp. 121\u2013128. SCITEPRESS (2020)","DOI":"10.5220\/0008866701210128"},{"key":"9_CR36","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 (2005)","DOI":"10.1109\/SFCS.2005.72"},{"key":"9_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"303","DOI":"10.1007\/978-3-540-68891-4_21","volume-title":"Integer Programming and Combinatorial Optimization","author":"C Nagarajan","year":"2008","unstructured":"Nagarajan, C., Williamson, D.P.: Offline and online facility leasing. In: Lodi, A., Panconesi, A., Rinaldi, G. (eds.) IPCO 2008. LNCS, vol. 5035, pp. 303\u2013315. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-68891-4_21"},{"issue":"4","key":"9_CR38","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. Discret. Optim. 10(4), 361\u2013370 (2013)","journal-title":"Discret. Optim."},{"key":"9_CR39","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/978-3-642-22006-7_4","volume-title":"Automata, Languages and Programming","author":"J Qian","year":"2011","unstructured":"Qian, J., Williamson, D.P.: An O(logn)-competitive algorithm for online constrained forest problems. In: Aceto, L., Henzinger, M., Sgall, J. (eds.) ICALP 2011. LNCS, vol. 6755, pp. 37\u201348. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22006-7_4"},{"issue":"2","key":"9_CR40","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)","journal-title":"Commun. ACM"}],"container-title":["Lecture Notes in Business Information Processing","Enterprise Information Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-08965-7_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,28]],"date-time":"2024-09-28T18:30:35Z","timestamp":1727548235000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-08965-7_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031089640","9783031089657"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-08965-7_9","relation":{},"ISSN":["1865-1348","1865-1356"],"issn-type":[{"type":"print","value":"1865-1348"},{"type":"electronic","value":"1865-1356"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"8 July 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICEIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Enterprise Information Systems","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":"26 April 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 April 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iceis2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.insticc.org\/node\/technicalprogram\/iceis\/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":"PROMORIS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"241","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":"59","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":"90","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":"24% - 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":"4","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)"}},{"value":"34 posters","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}