{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:59:03Z","timestamp":1780783143019,"version":"3.54.1"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032277312","type":"print"},{"value":"9783032277329","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-27732-9_29","type":"book-chapter","created":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:02Z","timestamp":1780780442000},"page":"415-429","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Domination and\u00a0Coverage Problems Under Vulnerability Constraints"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Lamprou","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Nikolaos","family":"Lazaropoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ioannis","family":"Sigalas","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Ioannis","family":"Vaxevanakis","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Vassilis","family":"Zissimopoulos","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,7]]},"reference":[{"key":"29_CR1","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.dam.2013.12.015","volume":"169","author":"A Arulselvan","year":"2014","unstructured":"Arulselvan, A.: A note on the set union knapsack problem. Discret. Appl. Math. 169, 214\u2013218 (2014)","journal-title":"Discret. Appl. Math."},{"issue":"2","key":"29_CR2","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2(2), 198\u2013203 (1981)","journal-title":"J. Algorithms"},{"key":"29_CR3","unstructured":"Carr, R.D., Doddi, S., Konjevod, G., Marathe, M.: On the red-blue set cover problem. In: Proceedings of the Eleventh Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 345\u2013353. SODA \u201900, USA (2000)"},{"key":"29_CR4","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1016\/j.tcs.2020.11.020","volume":"852","author":"H Chen","year":"2021","unstructured":"Chen, H., Loukides, G., Pissis, S.P., Chan, H.: Influence maximization in the presence of vulnerable nodes: a ratio perspective. Theoret. Comput. Sci. 852, 84\u2013103 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR5","doi-asserted-by":"crossref","unstructured":"Elkin, M., Peleg, D.: The hardness of approximating spanner problems. In: Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science, pp. 370\u2013381. STACS \u201900, Springer-Verlag, Berlin, Heidelberg (2000)","DOI":"10.1007\/3-540-46541-3_31"},{"issue":"4","key":"29_CR6","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)"},{"key":"29_CR7","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of domination in graphs, CRC Press (2013)","DOI":"10.1201\/9781482246582"},{"key":"29_CR8","series-title":"Developments in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51117-3","volume-title":"Topics in domination in graphs","year":"2020","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A. (eds.): Topics in domination in graphs. DM, vol. 64. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51117-3"},{"issue":"6","key":"29_CR9","doi-asserted-by":"publisher","first-page":"615","DOI":"10.1002\/(SICI)1520-6750(199809)45:6<615::AID-NAV5>3.0.CO;2-5","volume":"45","author":"DS Hochbaum","year":"1998","unstructured":"Hochbaum, D.S., Pathria, A.: Analysis of the greedy approach in problems of maximum k-coverage. Naval Res. Logistics (NRL) 45(6), 615\u2013627 (1998)","journal-title":"Naval Res. Logistics (NRL)"},{"issue":"4","key":"29_CR10","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1597036.1597045","volume":"5","author":"G Karakostas","year":"2009","unstructured":"Karakostas, G.: A better approximation ratio for the vertex cover problem. ACM Trans. Algorithms (TALG) 5(4), 1\u20138 (2009)","journal-title":"ACM Trans. Algorithms (TALG)"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Khuller, S., Purohit, M., Sarpatwar, K.K.: Analyzing the optimal neighborhood: algorithms for budgeted and partial connected dominating set problems. SODA, pp. 1702\u20131713 (2013)","DOI":"10.1137\/1.9781611973402.123"},{"issue":"1","key":"29_CR12","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/18M1212094","volume":"34","author":"S Khuller","year":"2020","unstructured":"Khuller, S., Purohit, M., Sarpatwar, K.K.: Analyzing the optimal neighborhood: algorithms for partial and budgeted connected dominating set problems. SIAM J. Discret. Math. 34(1), 251\u2013270 (2020)","journal-title":"SIAM J. Discret. Math."},{"key":"29_CR13","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1016\/j.tcs.2021.04.022","volume":"873","author":"I Lamprou","year":"2021","unstructured":"Lamprou, I., Martin, R., Schewe, S., Sigalas, I., Zissimopoulos, V.: Maximum rooted connected expansion. Theoret. Comput. Sci. 873, 25\u201337 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"368","DOI":"10.1007\/978-3-030-48966-3_28","volume-title":"Combinatorial Algorithms","author":"I Lamprou","year":"2020","unstructured":"Lamprou, I., Sigalas, I., Zissimopoulos, V.: Improved budgeted connected domination and budgeted edge-vertex domination. In: G\u0105sieniec, L., Klasing, R., Radzik, T. (eds.) IWOCA 2020. LNCS, vol. 12126, pp. 368\u2013381. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-48966-3_28"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/j.tcs.2021.01.030","volume":"858","author":"I Lamprou","year":"2021","unstructured":"Lamprou, I., Sigalas, I., Zissimopoulos, V.: Improved budgeted connected domination and budgeted edge-vertex domination. Theoret. Comput. Sci. 858, 1\u201312 (2021)","journal-title":"Theoret. Comput. Sci."},{"key":"29_CR16","unstructured":"Miyano, E., Ono, H.: Maximum domination problem. In: Proceedings of the Seventeenth Computing on The Australasian Theory Symposium-Volume 119, pp. 55\u201362 (2011)"},{"issue":"1","key":"29_CR17","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/BF01588971","volume":"14","author":"GL Nemhauser","year":"1978","unstructured":"Nemhauser, G.L., Wolsey, L.A., Fisher, M.L.: An analysis of approximations for maximizing submodular set functions. Math. Program. 14(1), 265\u2013294 (1978)","journal-title":"Math. Program."},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"Pasumarthi, R., Narayanam, R., Ravindran, B.: Near optimal strategies for targeted marketing in social networks. In: AAMAS, pp 1679\u20131680 (2015)","DOI":"10.65109\/LYCD2638"},{"issue":"1","key":"29_CR19","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/j.jda.2006.03.008","volume":"5","author":"D Peleg","year":"2007","unstructured":"Peleg, D.: Approximation algorithms for the label-covermax and red-blue set cover problems. J. Discr. Algorithms 5(1), 55\u201364 (2007)","journal-title":"J. Discr. Algorithms"},{"key":"29_CR20","volume-title":"Approximation algorithms","author":"VV Vazirani","year":"2001","unstructured":"Vazirani, V.V.: Approximation algorithms. Springer-Verlag, Berlin, Germany (2001)"},{"issue":"1","key":"29_CR21","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1109\/TNET.2024.3477532","volume":"33","author":"Z Wang","year":"2025","unstructured":"Wang, Z., et al.: Approximation algorithm and applications for connected submodular function maximization problems. IEEE Trans. Netw. 33(1), 241\u2013254 (2025)","journal-title":"IEEE Trans. Netw."},{"key":"29_CR22","doi-asserted-by":"crossref","unstructured":"Wen, Y.T., Peng, W.C., Shuai, H.H.: Maximizing social influence on target users. In: Advances in Knowledge Discovery and Data Mining: 22nd Pacific-Asia Conference, PAKDD 2018, Melbourne, VIC, Australia, 3\u20136 June 2018, Proceedings, Part III 22, pp. 701\u2013712. Springer (2018)","DOI":"10.1007\/978-3-319-93040-4_55"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-27732-9_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,6]],"date-time":"2026-06-06T21:14:04Z","timestamp":1780780444000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-27732-9_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032277312","9783032277329"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-27732-9_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"7 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IWOCA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Combinatorial Algorithms","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Clermont-Ferrand","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"France","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 June 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"37","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iwoca2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iwoca2026.limos.fr\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}