{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:34:51Z","timestamp":1742916891890,"version":"3.40.3"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031203497"},{"type":"electronic","value":"9783031203503"}],"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.springernature.com\/gp\/researchers\/text-and-data-mining"},{"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.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-20350-3_23","type":"book-chapter","created":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:12:32Z","timestamp":1672549952000},"page":"281-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Fault-Tolerant Total Domination via\u00a0Submodular Function Approximation"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Lamprou","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Sigalas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ioannis","family":"Vaxevanakis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vassilis","family":"Zissimopoulos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,1,1]]},"reference":[{"issue":"11","key":"23_CR1","doi-asserted-by":"publisher","first-page":"1264","DOI":"10.1016\/j.ic.2008.07.003","volume":"206","author":"M Chleb\u00edk","year":"2008","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness of dominating set problems in bounded degree graphs. Inf. Comput. 206(11), 1264\u20131275 (2008)","journal-title":"Inf. Comput."},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Cockayne, E.J., Dawes, R.M., Hedetniemi, S.T.: Total domination in graphs. Networks 10(3), 211\u2013219 (1980)","DOI":"10.1002\/net.3230100304"},{"key":"23_CR3","unstructured":"Du, D.Z., Graham, R.L., Pardalos, P.M., Wan, P.J., Wu, W., Zhao, W.: Analysis of greedy approximations with nonsubmodular potential functions. In: Proceedings of the Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 167\u2013175 (2008)"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Foerster, K.-T.: Approximating fault-tolerant domination in general graphs. In: 2013 Proceedings of the Tenth Workshop on Analytic Algorithmics and Combinatorics (ANALCO), pp. 25\u201332. SIAM (2013)","DOI":"10.1137\/1.9781611973037.4"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Ghiassian, S.D., Menche, J., Barab\u00e1si, A.-L.: A disease module detection (diamond) algorithm derived from a systematic analysis of connectivity patterns of disease proteins in the human interactome. PLoS Comput. Biol. 11(4), e1004120 (2015)","DOI":"10.1371\/journal.pcbi.1004120"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Haynes, T.W., Hedetniemi, S., Slater, P.: Fundamentals of Domination in Graphs. CRC Press, Boca Raton (2013)","DOI":"10.1201\/9781482246582"},{"key":"23_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-030-51117-3","volume-title":"Topics in Domination in Graphs","author":"TW Haynes","year":"2020","unstructured":"Haynes, T.W., Hedetniemi, S.T., Henning, M.A.: Topics in Domination in Graphs, vol. 64. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-51117-3"},{"key":"23_CR8","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4614-6525-6","volume-title":"Total Domination in Graphs","author":"MA Henning","year":"2013","unstructured":"Henning, M.A., Yeo, A.: Total Domination in Graphs. Springer, New York (2013). https:\/\/doi.org\/10.1007\/978-1-4614-6525-6"},{"key":"23_CR9","doi-asserted-by":"crossref","unstructured":"Jena, S.K., Das, G.K.: Total domination in unit disk graphs. CoRR, abs\/2007.11997 (2020)","DOI":"10.1007\/978-3-030-39219-2_6"},{"issue":"2","key":"23_CR10","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1016\/j.ipl.2003.10.004","volume":"89","author":"R Klasing","year":"2004","unstructured":"Klasing, R., Laforest, C.: Hardness results and approximation algorithms of k-tuple domination in graphs. Inf. Process. Lett. 89(2), 75\u201383 (2004)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"23_CR11","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/j.tcs.2004.08.013","volume":"329","author":"L Ruan","year":"2004","unstructured":"Ruan, L., Hongwei, D., Jia, X., Weili, W., Li, Y., Ker, I.K.: A greedy approximation for minimum connected dominating sets. Theoret. Comput. Sci. 329(1\u20133), 325\u2013330 (2004)","journal-title":"Theoret. Comput. Sci."},{"issue":"04","key":"23_CR12","doi-asserted-by":"publisher","first-page":"485","DOI":"10.1142\/S1793830909000361","volume":"1","author":"Z Zhang","year":"2009","unstructured":"Zhang, Z., Liu, Q., Li, D.: Two algorithms for connected r-hop k-dominating set. Discrete Math. Algorithms Appl. 1(04), 485\u2013498 (2009)","journal-title":"Discrete Math. Algorithms Appl."},{"issue":"1","key":"23_CR13","doi-asserted-by":"publisher","first-page":"310","DOI":"10.1007\/s10878-013-9638-4","volume":"28","author":"J Zhou","year":"2014","unstructured":"Zhou, J., Zhang, Z., Weili, W., Xing, K.: A greedy algorithm for the fault-tolerant connected dominating set in a general graph. J. Comb. Optim. 28(1), 310\u2013319 (2014)","journal-title":"J. Comb. Optim."},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Zhu, J.: Approximation for minimum total dominating set. In: Proceedings of the 2nd International Conference on Interaction Sciences: Information Technology, Culture and Human. ICIS 2009, pp. 119\u2013124. ACM, New York (2009)","DOI":"10.1145\/1655925.1655948"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-20350-3_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T05:25:14Z","timestamp":1672550714000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-20350-3_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031203497","9783031203503"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-20350-3_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"1 January 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2022","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/lxy.tjut.edu.cn\/TAMC2022.htm","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EquinOCS","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"75","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":"33","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":"44% - 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":"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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}