{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:50:12Z","timestamp":1743087012777,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030578510"},{"type":"electronic","value":"9783030578527"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-57852-7_3","type":"book-chapter","created":{"date-parts":[[2020,8,27]],"date-time":"2020-08-27T23:07:54Z","timestamp":1598569674000},"page":"32-47","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Complexity of the Upper r-Tolerant Edge Cover Problem"],"prefix":"10.1007","author":[{"given":"Ararat","family":"Harutyunyan","sequence":"first","affiliation":[]},{"given":"Mehdi Khosravian","family":"Ghadikolaei","sequence":"additional","affiliation":[]},{"given":"Nikolaos","family":"Melissinos","sequence":"additional","affiliation":[]},{"given":"J\u00e9r\u00f4me","family":"Monnot","sequence":"additional","affiliation":[]},{"given":"Aris","family":"Pagourtzis","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,8,28]]},"reference":[{"key":"3_CR1","first-page":"183","volume":"98","author":"S Arumugam","year":"2015","unstructured":"Arumugam, S., Hedetniemi, S.T., Hedetniemi, S.M., Sathikala, L., Sudha, S.: The covering chain of a graph. Util. Math. 98, 183\u2013196 (2015)","journal-title":"Util. Math."},{"key":"3_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-03816-7_9","volume-title":"Mathematical Foundations of Computer Science 2009","author":"S Athanassopoulos","year":"2009","unstructured":"Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Kyropoulou, M.: An improved approximation bound for spanning star forest and color saving. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol. 5734, pp. 90\u2013101. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-03816-7_9"},{"key":"3_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/978-3-030-25005-8_5","volume-title":"Combinatorial Algorithms","author":"S Banerjee","year":"2019","unstructured":"Banerjee, S., Bhore, S.: Algorithm and hardness results on Liar\u2019s dominating set and $${k}$$-tuple dominating set. In: Colbourn, C.J., Grossi, R., Pisanti, N. (eds.) IWOCA 2019. LNCS, vol. 11638, pp. 48\u201360. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-25005-8_5"},{"key":"3_CR4","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1016\/j.tcs.2017.05.042","volume":"717","author":"C Bazgan","year":"2018","unstructured":"Bazgan, C., et al.: The many facets of upper domination. Theoret. Comput. Sci. 717, 2\u201325 (2018)","journal-title":"Theoret. Comput. Sci."},{"issue":"1","key":"3_CR5","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1016\/0020-0190(84)90126-1","volume":"19","author":"AA Bertossi","year":"1984","unstructured":"Bertossi, A.A.: Dominating sets for split and bipartite graphs. Inf. Process. Lett. 19(1), 37\u201340 (1984)","journal-title":"Inf. Process. Lett."},{"issue":"1","key":"3_CR6","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1137\/0211015","volume":"11","author":"KS Booth","year":"1982","unstructured":"Booth, K.S., Johnson, J.H.: Dominating sets in chordal graphs. SIAM J. Comput. 11(1), 191\u2013199 (1982)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"3_CR7","first-page":"285","volume":"14","author":"GJ Chang","year":"2012","unstructured":"Chang, G.J., Dorbec, P., Kim, H.K., Raspaud, A., Wang, H., Zhao, W.: Upper k-tuple domination in graphs. Discrete Math. Theoret. Comput. Sci. 14(2), 285\u2013292 (2012)","journal-title":"Discrete Math. Theoret. Comput. Sci."},{"issue":"1","key":"3_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s00373-011-1040-3","volume":"28","author":"M Chellali","year":"2012","unstructured":"Chellali, M., Favaron, O., Hansberg, A., Volkmann, L.: k-domination and k-independence in graphs: a survey. Graphs Comb. 28(1), 1\u201355 (2012)","journal-title":"Graphs Comb."},{"issue":"3","key":"3_CR9","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1007\/s00453-011-9607-1","volume":"65","author":"N Chen","year":"2013","unstructured":"Chen, N., Engelberg, R., Nguyen, C.T., Raghavendra, P., Rudra, A., Singh, G.: Improved approximation algorithms for the spanning star forest problem. Algorithmica 65(3), 498\u2013516 (2013)","journal-title":"Algorithmica"},{"issue":"3","key":"3_CR10","doi-asserted-by":"publisher","first-page":"195","DOI":"10.1016\/0166-218X(90)90065-K","volume":"27","author":"GA Cheston","year":"1990","unstructured":"Cheston, G.A., Fricke, G., Hedetniemi, S.T., Jacobs, D.P.: On the computational complexity of upper fractional domination. Discrete Appl. Math. 27(3), 195\u2013207 (1990)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"3_CR11","doi-asserted-by":"publisher","first-page":"320","DOI":"10.1016\/j.tcs.2005.11.029","volume":"354","author":"M Chleb\u00edk","year":"2006","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Complexity of approximating bounded variants of optimization problems. Theoret. Comput. Sci. 354(3), 320\u2013338 (2006)","journal-title":"Theoret. Comput. Sci."},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"535","DOI":"10.1137\/0608044","volume":"8","author":"DG Corneil","year":"1987","unstructured":"Corneil, D.G., Keil, J.M.: A dynamic programming approach to the dominating set problem on $$k$$-trees. SIAM J. Algebraic Discrete Methods 8(4), 535\u2013543 (1987)","journal-title":"SIAM J. Algebraic Discrete Methods"},{"issue":"5","key":"3_CR13","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1016\/0020-0190(90)90147-P","volume":"36","author":"P Damaschke","year":"1990","unstructured":"Damaschke, P., M\u00fcller, H., Kratsch, D.: Domination in convex and chordal bipartite graphs. Inf. Process. Lett. 36(5), 231\u2013236 (1990)","journal-title":"Inf. Process. Lett."},{"key":"3_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/11611257_21","volume-title":"SOFSEM 2006: Theory and Practice of Computer Science","author":"F Dehne","year":"2006","unstructured":"Dehne, F., Fellows, M., Fernau, H., Prieto, E., Rosamond, F.: nonblocker: parameterized algorithmics for minimum dominating set. In: Wiedermann, J., Tel, G., Pokorn\u00fd, J., Bielikov\u00e1, M., \u0160tuller, J. (eds.) SOFSEM 2006. LNCS, vol. 3831, pp. 237\u2013245. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11611257_21"},{"issue":"8","key":"3_CR15","doi-asserted-by":"publisher","first-page":"1635","DOI":"10.1080\/00207160.2013.853052","volume":"91","author":"M Demange","year":"2014","unstructured":"Demange, M., Ekim, T., Tanasescu, C.: Hardness and approximation of minimum maximal matchings. Int. J. Comput. Math. 91(8), 1635\u20131654 (2014)","journal-title":"Int. J. Comput. Math."},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1016\/0166-218X(84)90061-1","volume":"7","author":"M Farber","year":"1984","unstructured":"Farber, M.: Domination, independent domination and duality in strongly chordal graphs. Discrete Appl. Math. 7, 115\u2013130 (1984)","journal-title":"Discrete Appl. Math."},{"key":"3_CR17","first-page":"149","volume":"7","author":"H Fernau","year":"2009","unstructured":"Fernau, H., Manlove, D.F.: Vertex and edge covers with clustering properties: complexity and algorithms. J. Disc. Alg. 7, 149\u2013167 (2009)","journal-title":"J. Disc. Alg."},{"key":"3_CR18","unstructured":"Fink, J.F., Jacobson, M.S.: n-domination in graphs. In: Graph Theory with Applications to Algorithms and Computer Science, pp. 283\u2013300. Wiley, New York (1985)"},{"issue":"5\u20136","key":"3_CR19","doi-asserted-by":"publisher","first-page":"880","DOI":"10.1016\/j.disc.2007.07.033","volume":"308","author":"A Gagarin","year":"2008","unstructured":"Gagarin, A., Zverovich, V.E.: A generalised upper bound for the k-tuple domination number. Discrete Math. 308(5\u20136), 880\u2013885 (2008)","journal-title":"Discrete Math."},{"key":"3_CR20","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"MR Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York (1979)"},{"key":"3_CR21","first-page":"201","volume":"55","author":"F Harary","year":"2000","unstructured":"Harary, F., Haynes, T.W.: Double domination in graphs. Ars Comb. 55, 201\u2013214 (2000)","journal-title":"Ars Comb."},{"key":"3_CR22","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs, vol. 208. Pure and Applied Mathematics, Dekker, New York (1998)"},{"issue":"3","key":"3_CR23","doi-asserted-by":"publisher","first-page":"375","DOI":"10.1137\/0406030","volume":"6","author":"Joseph Douglas Horton and Kyriakos Kilakos","year":"1993","unstructured":"Joseph Douglas Horton and Kyriakos Kilakos: Minimum edge dominating sets. SIAM J. Discrete Math. 6(3), 375\u2013387 (1993)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"3_CR24","doi-asserted-by":"publisher","first-page":"65","DOI":"10.7155\/jgaa.00519","volume":"24","author":"K Khoshkhah","year":"2020","unstructured":"Khoshkhah, K., Ghadikolaei, M.K., Monnot, J., Sikora, F.: Weighted upper edge cover: complexity and approximability. J. Graph Algorithms Appl. 24(2), 65\u201388 (2020)","journal-title":"J. Graph Algorithms Appl."},{"issue":"2","key":"3_CR25","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","key":"3_CR26","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1016\/S0020-0190(03)00233-3","volume":"87","author":"C-S Liao","year":"2003","unstructured":"Liao, C.-S., Chang, G.J.: k-tuple domination in graphs. Inf. Process. Lett. 87(1), 45\u201350 (2003)","journal-title":"Inf. Process. Lett."},{"issue":"1\u20133","key":"3_CR27","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/S0166-218X(98)00147-4","volume":"91","author":"DF Manlove","year":"1999","unstructured":"Manlove, D.F.: On the algorithmic complexity of twelve covering and independence parameters of graphs. Discrete Appl. Math. 91(1\u20133), 155\u2013175 (1999)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"3_CR28","doi-asserted-by":"publisher","first-page":"946","DOI":"10.1137\/070682150","volume":"38","author":"CT Nguyen","year":"2008","unstructured":"Nguyen, C.T., Shen, J., Hou, M., Sheng, L., Miller, W., Zhang, L.: Approximating the spanning star forest problem and its application to genomic sequence alignment. SIAM J. Comput. 38(3), 946\u2013962 (2008)","journal-title":"SIAM J. Comput."},{"key":"3_CR29","volume-title":"Combinatorial Optimization: Polyhedra and Efficiency","author":"A Schrijver","year":"2003","unstructured":"Schrijver, A.: Combinatorial Optimization: Polyhedra and Efficiency. Springer, Heidelberg (2003)"},{"issue":"3","key":"3_CR30","doi-asserted-by":"publisher","first-page":"197","DOI":"10.6028\/jres.082.019","volume":"82","author":"PJ Slater","year":"1977","unstructured":"Slater, P.J.: Enclaveless sets and MK-systems. J. Res. Nat. Bur. Stand. 82(3), 197\u2013202 (1977)","journal-title":"J. Res. Nat. Bur. Stand."}],"container-title":["Lecture Notes in Computer Science","Topics in Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-57852-7_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,28]],"date-time":"2024-08-28T00:02:31Z","timestamp":1724803351000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57852-7_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030578510","9783030578527"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57852-7_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"28 August 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TTCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Topics in Theoretical Computer Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Tehran","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Iran","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icttcs2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/cs.ipm.ac.ir\/ttcs\/2020\/","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24","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":"8","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":"33% - 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":"2","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)"}},{"value":"The conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}