{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T12:44:47Z","timestamp":1743079487562,"version":"3.40.3"},"publisher-location":"Cham","reference-count":34,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030108007"},{"type":"electronic","value":"9783030108014"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-10801-4_37","type":"book-chapter","created":{"date-parts":[[2019,1,10]],"date-time":"2019-01-10T09:38:37Z","timestamp":1547113117000},"page":"473-489","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Algorithms and Complexity Results for the Capacitated Vertex Cover Problem"],"prefix":"10.1007","author":[{"given":"Sebastiaan B.","family":"van Rooij","sequence":"first","affiliation":[]},{"given":"Johan M. M.","family":"van Rooij","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,1,11]]},"reference":[{"issue":"2","key":"37_CR1","doi-asserted-by":"publisher","first-page":"149","DOI":"10.1007\/BF02122796","volume":"8","author":"HJ Bandelt","year":"1988","unstructured":"Bandelt, H.J.: Hereditary modular graphs. Combinatorica 8(2), 149\u2013157 (1988)","journal-title":"Combinatorica"},{"key":"37_CR2","unstructured":"Bodlaender, H.L., et al.: Open problems in parameterized and exact computation - IWPEC 2008. Technical report UU-CS-2008-017, Department of Information and Computing Sciences, Utrecht University (2008)"},{"issue":"1-2","key":"37_CR3","doi-asserted-by":"publisher","first-page":"382","DOI":"10.1007\/s00453-010-9460-7","volume":"62","author":"Nicolas Bourgeois","year":"2010","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.Th., van Rooij, J.M.M.: Fast algorithms for max independent set. Algorithmica 62(1), 382\u2013415 (2012)","journal-title":"Algorithmica"},{"issue":"40","key":"37_CR4","doi-asserted-by":"publisher","first-page":"3736","DOI":"10.1016\/j.tcs.2010.06.026","volume":"411","author":"J Chen","year":"2010","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved upper bounds for vertex cover. Theoret. Comput. Sci. 411(40), 3736\u20133756 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"37_CR5","doi-asserted-by":"crossref","unstructured":"Cygan, M., Nederlof, J., Pilipczuk, M., Pilipczuk, M., van Rooij, J.M.M., Wojtaszczyk, J.O.: Solving connectivity problems parameterized by treewidth in single exponential time. arXiv.org. The Computing Research Repository abs\/1103.0534 (2011)","DOI":"10.1109\/FOCS.2011.23"},{"issue":"40\u201342","key":"37_CR6","doi-asserted-by":"publisher","first-page":"3701","DOI":"10.1016\/j.tcs.2010.06.018","volume":"411","author":"M Cygan","year":"2010","unstructured":"Cygan, M., Pilipczuk, M.: Exact and approximate bandwidth. Theoret. Comput. Sci. 411(40\u201342), 3701\u20133713 (2010)","journal-title":"Theoret. Comput. Sci."},{"issue":"23","key":"37_CR7","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1016\/j.ipl.2011.09.004","volume":"111","author":"M Cygan","year":"2011","unstructured":"Cygan, M., Pilipczuk, M., Wojtaszczyk, J.O.: Capacitated domination faster than O($$2^n$$). Inf. Process. Lett. 111(23), 1099\u20131103 (2011)","journal-title":"Inf. Process. Lett."},{"key":"37_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"78","DOI":"10.1007\/978-3-540-79723-4_9","volume-title":"Parameterized and Exact Computation","author":"M Dom","year":"2008","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S., Villanger, Y.: Capacitated domination and covering: a parameterized perspective. In: Grohe, M., Niedermeier, R. (eds.) IWPEC 2008. LNCS, vol. 5018, pp. 78\u201390. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-79723-4_9"},{"issue":"5","key":"37_CR9","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1552285.1552286","volume":"56","author":"Fedor V. Fomin","year":"2009","unstructured":"Fomin, F.V., Grandoni, F., Kratsch, D.: A measure & conquer approach for the analysis of exact algorithms. J. ACM 56(5), 25:1\u201325:32 (2009)","journal-title":"Journal of the ACM"},{"issue":"5","key":"37_CR10","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ipl.2005.10.012","volume":"97","author":"FV Fomin","year":"2006","unstructured":"Fomin, F.V., H\u00f8ie, K.: Pathwidth of cubic graphs and exact algorithms. Inf. Process. Lett. 97(5), 191\u2013196 (2006)","journal-title":"Inf. Process. Lett."},{"key":"37_CR11","series-title":"Texts in Theoretical Computer Science. An EATCS Series","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. TTCSAES. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7"},{"key":"37_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"245","DOI":"10.1007\/978-3-540-30559-0_21","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"FV Fomin","year":"2004","unstructured":"Fomin, F.V., Kratsch, D., Woeginger, G.J.: Exact (exponential) algorithms for the dominating set problem. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol. 3353, pp. 245\u2013256. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30559-0_21"},{"key":"37_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/978-3-540-24749-4_6","volume-title":"STACS 2004","author":"FV Fomin","year":"2004","unstructured":"Fomin, F.V., Thilikos, D.M.: A simple and fast approach for solving problems on planar graphs. In: Diekert, V., Habib, M. (eds.) STACS 2004. LNCS, vol. 2996, pp. 56\u201367. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24749-4_6"},{"key":"37_CR14","unstructured":"F\u00fcrer, M., Raghavachari, B.: Approximating the minimum degree spanning tree to within one from the optimal degree. In: 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 1992. pp. 317\u2013324. Society for Industrial and Applied Mathematics (1992)"},{"issue":"4","key":"37_CR15","doi-asserted-by":"publisher","first-page":"826","DOI":"10.1137\/0132071","volume":"32","author":"MR Garey","year":"1977","unstructured":"Garey, M.R., Johnson, D.S.: The rectilinear steiner tree problem is NP-complete. SIAM J. Appl. Math. 32(4), 826\u2013834 (1977)","journal-title":"SIAM J. Appl. Math."},{"issue":"2","key":"37_CR16","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1016\/j.jda.2005.03.002","volume":"4","author":"F Grandoni","year":"2006","unstructured":"Grandoni, F.: A note on the complexity of minimum dominating set. J. Discret. Algorithms 4(2), 209\u2013214 (2006)","journal-title":"J. Discret. Algorithms"},{"key":"37_CR17","unstructured":"Guha, S., Hassin, R., Khuller, S., Or, E.: Capacitated vertex covering with applications. In: 13th Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2002, pp. 858\u2013865. Society for Industrial and Applied Mathematics (2002)"},{"issue":"3","key":"37_CR18","doi-asserted-by":"publisher","first-page":"501","DOI":"10.1007\/s00224-007-1309-3","volume":"41","author":"J Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Parameterized complexity of vertex cover variants. Theory Comput. Syst. 41(3), 501\u2013520 (2007)","journal-title":"Theory Comput. Syst."},{"issue":"6","key":"37_CR19","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s00373-007-0757-5","volume":"23","author":"MA Henning","year":"2007","unstructured":"Henning, M.A., Yeo, A.: Tight lower bounds on the size of a maximum matching in a regular graph. Graphs Comb. 23(6), 647\u2013657 (2007)","journal-title":"Graphs Comb."},{"issue":"2","key":"37_CR20","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1006\/jcss.2000.1727","volume":"62","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R.: On the complexity of $$k$$-SAT. J. Comput. Syst. Sci. 62(2), 367\u2013375 (2001)","journal-title":"J. Comput. Syst. Sci."},{"issue":"4","key":"37_CR21","doi-asserted-by":"publisher","first-page":"512","DOI":"10.1006\/jcss.2001.1774","volume":"63","author":"R Impagliazzo","year":"2001","unstructured":"Impagliazzo, R., Paturi, R., Zane, F.: Which problems have strongly exponential complexity? J. Comput. Syst. Sci. 63(4), 512\u2013530 (2001)","journal-title":"J. Comput. Syst. Sci."},{"key":"37_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1007\/978-3-642-28050-4_4","volume-title":"Parameterized and Exact Computation","author":"Y Iwata","year":"2012","unstructured":"Iwata, Y.: A faster algorithm for dominating set analyzed by the potential method. In: Marx, D., Rossmanith, P. (eds.) IPEC 2011. LNCS, vol. 7112, pp. 41\u201354. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-28050-4_4"},{"key":"37_CR23","doi-asserted-by":"crossref","unstructured":"Jian, T.: An $${O}(2^{0.304n})$$ algorithm for solving maximum independent set problem. IEEE Trans. Comput. 35(9), 847\u2013851 (1986)","DOI":"10.1109\/TC.1986.1676847"},{"key":"37_CR24","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0045375","volume-title":"Treewidth","year":"1994","unstructured":"Kloks, T. (ed.): Treewidth. LNCS, vol. 842. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/BFb0045375"},{"key":"37_CR25","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: A fine-grained analysis of a simple independent set algorithm. In: 29th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, FSTTCS 2009, pp. 287\u2013298. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2009)"},{"key":"37_CR26","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1016\/j.dam.2012.10.021","volume":"168","author":"M Liedloff","year":"2014","unstructured":"Liedloff, M., Todinca, I., Villanger, Y.: Solving capacitated dominating set by using covering by subsets and maximum matching. Discret. Appl. Math. 168, 60\u201368 (2014)","journal-title":"Discret. Appl. Math."},{"key":"37_CR27","first-page":"685","volume":"69","author":"J Nederlof","year":"2014","unstructured":"Nederlof, J., van Rooij, J.M.M., van Dijk, T.C.: Inclusion\/exclusion meets measure and conquer. Algorithmica 69, 685\u2013740 (2014)","journal-title":"Algorithmica"},{"issue":"3","key":"37_CR28","doi-asserted-by":"publisher","first-page":"425","DOI":"10.1016\/0196-6774(86)90032-5","volume":"7","author":"JM Robson","year":"1986","unstructured":"Robson, J.M.: Algorithms for maximum independent sets. J. Algorithms 7(3), 425\u2013440 (1986)","journal-title":"J. Algorithms"},{"key":"37_CR29","unstructured":"Robson, J.M.: Finding a maximum independent set in time $${O}(2^{n\/4})$$. Technical report, Laboratoire Bordelais de Recherche en Informatique, Universit\u00e9 Bordeaux I, 1251\u201301, Bordeaux, France (2001)"},{"key":"37_CR30","unstructured":"van Rooij, S.B.: A search for faster algorithms for the capacitated vertex cover problem. Master\u2019s thesis. Department of Information and Computing Sciences, Utrecht University (2018)"},{"issue":"17","key":"37_CR31","doi-asserted-by":"publisher","first-page":"2147","DOI":"10.1016\/j.dam.2011.07.001","volume":"159","author":"JMM van Rooij","year":"2011","unstructured":"van Rooij, J.M.M., Bodlaender, H.L.: Exact algorithms for dominating set. Discret. Appl. Math. 159(17), 2147\u20132164 (2011)","journal-title":"Discret. Appl. Math."},{"issue":"17","key":"37_CR32","doi-asserted-by":"publisher","first-page":"3291","DOI":"10.1016\/j.dam.2008.05.035","volume":"156","author":"I Schiermeyer","year":"2008","unstructured":"Schiermeyer, I.: Efficiency in exponential time for domination-type problems. Discret. Appl. Math. 156(17), 3291\u20133297 (2008)","journal-title":"Discret. Appl. Math."},{"issue":"3","key":"37_CR33","doi-asserted-by":"publisher","first-page":"537","DOI":"10.1137\/0206038","volume":"6","author":"RE Tarjan","year":"1977","unstructured":"Tarjan, R.E., Trojanowski, A.E.: Finding a maximum independent set. SIAM J. Comput. 6(3), 537\u2013546 (1977)","journal-title":"SIAM J. Comput."},{"key":"37_CR34","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1016\/j.ic.2017.06.001","volume":"255","author":"M Xiao","year":"2017","unstructured":"Xiao, M., Nagamochi, H.: Exact algorithms for maximum independent set. Inf. Comput. 255, 126\u2013146 (2017)","journal-title":"Inf. Comput."}],"container-title":["Lecture Notes in Computer Science","SOFSEM 2019: Theory and Practice of Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-10801-4_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T11:18:37Z","timestamp":1709810317000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-10801-4_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030108007","9783030108014"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-10801-4_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"11 January 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SOFSEM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Current Trends in Theory and Practice of Informatics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Nov\u00fd Smokovec","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"45","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sofsem2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/beda.dcs.fmph.uniba.sk\/sofsem2019\/","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":"92","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":"35","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":"6","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":"38% - 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":"3.3","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)"}}]}}