{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T13:28:18Z","timestamp":1743082098759,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030500252"},{"type":"electronic","value":"9783030500269"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-50026-9_16","type":"book-chapter","created":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:02:43Z","timestamp":1592780563000},"page":"224-236","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["On the Parameterized Complexity of the Expected Coverage Problem"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-1955-4612","authenticated-orcid":false,"given":"Fedor V.","family":"Fomin","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8554-6392","authenticated-orcid":false,"given":"Vijayaragunathan","family":"Ramamoorthi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,6,22]]},"reference":[{"key":"16_CR1","unstructured":"Ageev, A.A.: A criterion of polynomial-time solvability for the network location problem. In: Proceedings of the 2nd Integer Programming and Combinatorial Optimization Conference, Pittsburgh, PA, USA, May 1992, pp. 237\u2013245 (1992)"},{"issue":"3","key":"16_CR2","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1145\/990308.990309","volume":"51","author":"J Alber","year":"2004","unstructured":"Alber, J., Fellows, M.R., Niedermeier, R.: Polynomial-time data reduction for dominating set. J. ACM 51(3), 363\u2013384 (2004)","journal-title":"J. ACM"},{"issue":"1","key":"16_CR3","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.jalgor.2004.03.005","volume":"52","author":"J Alber","year":"2004","unstructured":"Alber, J., Fernau, H., Niedermeier, R.: Parameterized complexity: exponential speed-up for planar graph problems. J. Algorithms 52(1), 26\u201356 (2004)","journal-title":"J. Algorithms"},{"issue":"10","key":"16_CR4","doi-asserted-by":"crossref","first-page":"1675","DOI":"10.1016\/j.cor.2009.11.003","volume":"37","author":"O Berman","year":"2010","unstructured":"Berman, O., Drezner, Z., Krass, D.: Generalized coverage: new developments in covering location models. Comput. Oper. Res 37(10), 1675\u20131687 (2010)","journal-title":"Comput. Oper. Res"},{"issue":"1","key":"16_CR5","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1111\/j.1538-4632.2009.00746.x","volume":"41","author":"O Berman","year":"2009","unstructured":"Berman, O., Drezner, Z., Wesolowsky, G.O.: The maximal covering problem with some negative weights. Geograph. Anal. 41(1), 30\u201342 (2009)","journal-title":"Geograph. Anal."},{"key":"16_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"62","DOI":"10.1007\/978-3-030-17402-6_6","volume-title":"Algorithms and Complexity","author":"R van Bevern","year":"2019","unstructured":"van Bevern, R., Tsidulko, O.Y., Zschoche, P.: Fixed-parameter algorithms for maximum-profit facility location under matroid constraints. In: Heggernes, P. (ed.) CIAC 2019. LNCS, vol. 11485, pp. 62\u201374. Springer, Cham (2019). \nhttps:\/\/doi.org\/10.1007\/978-3-030-17402-6_6"},{"key":"16_CR7","unstructured":"Charikar, M., Guha, S.: Improved combinatorial algorithms for the facility location and k-median problems. In: 40th Annual Symposium on Foundations of Computer Science, FOCS 1999, New York, NY, USA, 17\u201318 October 1999, pp. 378\u2013388 (1999)"},{"issue":"1","key":"16_CR8","doi-asserted-by":"crossref","first-page":"101","DOI":"10.1007\/BF01942293","volume":"32","author":"R Church","year":"1974","unstructured":"Church, R., Velle, C.R.: The maximal covering location problem. Pap. Reg. Sci. 32(1), 101\u2013118 (1974)","journal-title":"Pap. Reg. Sci."},{"issue":"1","key":"16_CR9","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1016\/S0304-3975(97)00124-2","volume":"209","author":"CJ Colbourn","year":"1998","unstructured":"Colbourn, C.J., Xue, G.: A linear time algorithm for computing the most reliable source on a series-parallel graph with unreliable edges. Theor. Comput. Sci. 209(1), 331\u2013345 (1998)","journal-title":"Theor. Comput. Sci."},{"key":"16_CR10","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-21275-3","volume-title":"Parameterized Algorithms","author":"M Cygan","year":"2015","unstructured":"Cygan, M., et al.: Parameterized Algorithms. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"issue":"6","key":"16_CR11","doi-asserted-by":"crossref","first-page":"866","DOI":"10.1145\/1101821.1101823","volume":"52","author":"ED Demaine","year":"2005","unstructured":"Demaine, E.D., Fomin, F.V., Hajiaghayi, M.T., Thilikos, D.M.: Subexponential parameterized algorithms on graphs of bounded genus and $$H$$-minor-free graphs. J. ACM 52(6), 866\u2013893 (2005)","journal-title":"J. ACM"},{"key":"16_CR12","series-title":"GTM","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-662-53622-3","volume-title":"Graph Theory","author":"R Diestel","year":"2017","unstructured":"Diestel, R.: Graph Theory. GTM, vol. 173. Springer, Heidelberg (2017). \nhttps:\/\/doi.org\/10.1007\/978-3-662-53622-3"},{"key":"16_CR13","doi-asserted-by":"crossref","unstructured":"Ding, W.: Computing the most reliable source on stochastic ring networks. In: 2009 WRI World Congress on Software Engineering, vol. 1, pp. 345\u2013347, May 2009","DOI":"10.1109\/WCSE.2009.31"},{"key":"16_CR14","doi-asserted-by":"crossref","unstructured":"Ding, W.: Extended most reliable source on an unreliable general network. In: 2011 International Conference on Internet Computing and Information Services, pp. 529\u2013533, September 2011","DOI":"10.1109\/ICICIS.2011.138"},{"issue":"3","key":"16_CR15","doi-asserted-by":"crossref","first-page":"225","DOI":"10.1016\/j.tcs.2009.08.003","volume":"412","author":"W Ding","year":"2011","unstructured":"Ding, W., Xue, G.: A linear time algorithm for computing a most reliable source on a tree network with faulty nodes. Theor. Comput. Sci. 412(3), 225\u2013232 (2011). Combinatorial Optimization and Applications","journal-title":"Theor. Comput. Sci."},{"key":"16_CR16","unstructured":"Downey, R.G., Fellows, M.R.: Fixed parameter tractability and completeness. In: Complexity Theory: Current Research, Dagstuhl Workshop, 2\u20138 February 1992, pp. 191\u2013225 (1992)"},{"key":"16_CR17","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4471-5559-1","volume-title":"Fundamentals of Parameterized Complexity","author":"RG Downey","year":"2013","unstructured":"Downey, R.G., Fellows, M.R.: Fundamentals of Parameterized Complexity. Texts in Computer Science. Springer, London (2013). \nhttps:\/\/doi.org\/10.1007\/978-1-4471-5559-1"},{"key":"16_CR18","unstructured":"Drange, P.G., et al.: Kernelization and sparseness: the case of dominating set. In: Proceedings of the 33rd International Symposium on Theoretical Aspects of Computer Science (STACS). LIPIcs, vol. 47, pp. 31:1\u201331:14. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2016)"},{"issue":"3","key":"16_CR19","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1002\/net.3230220303","volume":"22","author":"HA Eiselt","year":"1992","unstructured":"Eiselt, H.A., Gendreau, M., Laporte, G.: Location of facilities on a network subject to a single-edge failure. Networks 22(3), 231\u2013246 (1992)","journal-title":"Networks"},{"key":"16_CR20","unstructured":"Feldmann, A.E., Marx, D.: The parameterized hardness of the k-center problem in transportation networks. In: 16th Scandinavian Symposium and Workshops on Algorithm Theory, SWAT 2018, Malm\u00f6, Sweden, 18\u201320 June 2018, vol. 101, pp. 19:1\u201319:13 (2018)"},{"issue":"11","key":"16_CR21","doi-asserted-by":"crossref","first-page":"1118","DOI":"10.1016\/j.dam.2011.03.021","volume":"159","author":"MR Fellows","year":"2011","unstructured":"Fellows, M.R., Fernau, H.: Facility location problems: a parameterized view. Discrete Appl. Math. 159(11), 1118\u20131130 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"16","key":"16_CR22","doi-asserted-by":"crossref","first-page":"814","DOI":"10.1016\/j.ipl.2011.05.016","volume":"111","author":"FV Fomin","year":"2011","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Subexponential algorithms for partial cover problems. Inf. Process. Lett. 111(16), 814\u2013818 (2011)","journal-title":"Inf. Process. Lett."},{"key":"16_CR23","doi-asserted-by":"crossref","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. In: Proceedings of the 21st Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 503\u2013510. SIAM (2010)","DOI":"10.1137\/1.9781611973075.43"},{"issue":"1","key":"16_CR24","doi-asserted-by":"crossref","first-page":"6:1","DOI":"10.1145\/3155298","volume":"14","author":"FV Fomin","year":"2018","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Kernels for (connected) dominating set on graphs with excluded topological minors. ACM Trans. Algorithms 14(1), 6:1\u20136:31 (2018)","journal-title":"ACM Trans. Algorithms"},{"key":"16_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-48523-6_30","volume-title":"Automata, Languages and Programming","author":"M Frick","year":"1999","unstructured":"Frick, M., Grohe, M.: Deciding first-order properties of locally tree-decomposable graphs. In: Wiedermann, J., van Emde Boas, P., Nielsen, M. (eds.) ICALP 1999. LNCS, vol. 1644, pp. 331\u2013340. Springer, Heidelberg (1999). \nhttps:\/\/doi.org\/10.1007\/3-540-48523-6_30"},{"key":"16_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"275","DOI":"10.1007\/978-3-642-04128-0_24","volume-title":"Algorithms - ESA 2009","author":"R Hassin","year":"2009","unstructured":"Hassin, R., Ravi, R., Salman, F.S.: Tractable cases of facility location on a network with a linear reliability order of links. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol. 5757, pp. 275\u2013276. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-04128-0_24"},{"key":"16_CR27","doi-asserted-by":"publisher","first-page":"931","DOI":"10.1007\/s10878-017-0121-5","volume":"34","author":"R Hassin","year":"2017","unstructured":"Hassin, R., Ravi, R., Salman, F.S.: Multiple facility location on a network with linear reliability order of edges. J. Comb. Optim. 34, 931\u2013955 (2017). \nhttps:\/\/doi.org\/10.1007\/s10878-017-0121-5","journal-title":"J. Comb. Optim."},{"volume-title":"Approximation Algorithms for NP-Hard Problems","year":"1997","key":"16_CR28","unstructured":"Hochbaum, D.S. (ed.): Approximation Algorithms for NP-Hard Problems. PWS Publishing Co., Boston (1997)"},{"issue":"1","key":"16_CR29","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1016\/S0020-0190(99)00031-9","volume":"70","author":"S Khuller","year":"1999","unstructured":"Khuller, S., Moss, A., Naor, J.: The budgeted maximum coverage problem. Inf. Process. Lett. 70(1), 39\u201345 (1999)","journal-title":"Inf. Process. Lett."},{"key":"16_CR30","doi-asserted-by":"publisher","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994). \nhttps:\/\/doi.org\/10.1007\/BFb0045375","DOI":"10.1007\/BFb0045375"},{"key":"16_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-540-69507-3_31","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"J Kneis","year":"2007","unstructured":"Kneis, J., M\u00f6lle, D., Rossmanith, P.: Partial vs. complete domination: t-dominating set. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol. 4362, pp. 367\u2013376. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-69507-3_31"},{"issue":"4","key":"16_CR32","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1002\/(SICI)1097-0037(199605)27:3<219::AID-NET7>3.0.CO;2-L","volume":"27","author":"E Melachrinoudis","year":"1996","unstructured":"Melachrinoudis, E., Helander, M.E.: A single facility location problem on a tree with unreliable edges. Networks 27(4), 219\u2013237 (1996)","journal-title":"Networks"},{"key":"16_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"269","DOI":"10.1007\/978-3-319-90530-3_23","volume-title":"Computer Science \u2013 Theory and Applications","author":"NS Narayanaswamy","year":"2018","unstructured":"Narayanaswamy, N.S., Nasre, M., Vijayaragunathan, R.: Facility location on planar graphs with unreliable links. In: Fomin, F.V., Podolskii, V.V. (eds.) CSR 2018. LNCS, vol. 10846, pp. 269\u2013281. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-90530-3_23"},{"issue":"1","key":"16_CR34","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/2390176.2390187","volume":"9","author":"G Philip","year":"2012","unstructured":"Philip, G., Raman, V., Sikdar, S.: Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond. ACM Trans. Algorithms 9(1), 11 (2012)","journal-title":"ACM Trans. Algorithms"}],"container-title":["Lecture Notes in Computer Science","Computer Science \u2013 Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-50026-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,6,21]],"date-time":"2020-06-21T23:06:52Z","timestamp":1592780812000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-50026-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030500252","9783030500269"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-50026-9_16","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":"22 June 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CSR","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Computer Science Symposium in Russia","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Yekaterinburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Russia","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":"29 June 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"csr2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/csr2020.sciencesconf.org\/","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":"49","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":"25","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":"51% - 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":"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 cancelled as a live conference due to the corona 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)"}}]}}