{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,2]],"date-time":"2025-12-02T15:04:12Z","timestamp":1764687852314,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030271947"},{"type":"electronic","value":"9783030271954"}],"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-27195-4_10","type":"book-chapter","created":{"date-parts":[[2019,8,1]],"date-time":"2019-08-01T09:03:14Z","timestamp":1564650194000},"page":"108-120","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Profit Parameterizations of Dominating\u00a0Set"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4444-3220","authenticated-orcid":false,"given":"Henning","family":"Fernau","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9466-7196","authenticated-orcid":false,"given":"Ulrike","family":"Stege","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,1]]},"reference":[{"issue":"3","key":"10_CR1","doi-asserted-by":"publisher","first-page":"503","DOI":"10.1016\/j.jcss.2015.11.010","volume":"82","author":"FN Abu-Khzam","year":"2016","unstructured":"Abu-Khzam, F.N., Bazgan, C., Chopin, M., Fernau, H.: Data reductions and combinatorial bounds for improved approximation algorithms. J. Comput. Syst. Sci. 82(3), 503\u2013520 (2016)","journal-title":"J. Comput. Syst. Sci."},{"key":"10_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":"10_CR3","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.dam.2012.11.013","volume":"165","author":"S Bermudo","year":"2014","unstructured":"Bermudo, S., Fernau, H.: Computing the differential of a graph: hardness, approximability and exact algorithms. Discrete Appl. Math. 165, 69\u201382 (2014)","journal-title":"Discrete Appl. Math."},{"key":"10_CR4","doi-asserted-by":"publisher","first-page":"155","DOI":"10.2298\/AADM140210003B","volume":"8","author":"S Bermudo","year":"2014","unstructured":"Bermudo, S., Fernau, H., Sigarreta, J.M.: The differential and the Roman domination number of a graph. Applicable Anal. Discrete Math. 8, 155\u2013171 (2014)","journal-title":"Applicable Anal. Discrete Math."},{"key":"10_CR5","doi-asserted-by":"publisher","first-page":"323","DOI":"10.1007\/s00453-011-9533-2","volume":"63","author":"D Binkele-Raible","year":"2012","unstructured":"Binkele-Raible, D., Fernau, H.: An exact exponential time algorithm for Power Dominating Set. Algorithmica 63, 323\u2013346 (2012)","journal-title":"Algorithmica"},{"key":"10_CR6","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/s00453-011-9566-6","volume":"64","author":"D Binkele-Raible","year":"2012","unstructured":"Binkele-Raible, D., Fernau, H.: Parameterized measure & conquer for problems with no small kernels. Algorithmica 64, 189\u2013212 (2012)","journal-title":"Algorithmica"},{"issue":"3","key":"10_CR7","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"},{"key":"10_CR8","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, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-319-21275-3"},{"key":"10_CR9","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"},{"key":"10_CR10","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 45, 634\u2013652 (1998)","journal-title":"J. ACM"},{"key":"10_CR11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-16533-7","volume-title":"Exact Exponential Algorithms. Texts in Theoretical Computer Science","author":"FV Fomin","year":"2010","unstructured":"Fomin, F.V., Kratsch, D.: Exact Exponential Algorithms. Texts in Theoretical Computer Science. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16533-7"},{"key":"10_CR12","unstructured":"Haynes, T.W., Hedetniemi, S.T., Slater, P.J.: Fundamentals of Domination in Graphs. Monographs and Textbooks in Pure and Applied Mathematics, vol. 208. Marcel Dekker, New York (1998)"},{"key":"10_CR13","doi-asserted-by":"publisher","first-page":"85","DOI":"10.1007\/978-1-4684-2001-2_9","volume-title":"Complexity of Computer Computations","author":"RM Karp","year":"1972","unstructured":"Karp, R.M.: Reducibility among combinatorial problems. In: Miller, R.E., Thatcher, J.W. (eds.) Complexity of Computer Computations, pp. 85\u2013103. Plenum Press, New York (1972)"},{"key":"10_CR14","first-page":"43","volume":"69","author":"JL Mashburn","year":"2006","unstructured":"Mashburn, J.L., Haynes, T.W., Hedetniemi, S.M., Hedetniemi, S.T., Slater, P.J.: Differentials in graphs. Utilitas Mathematica 69, 43\u201354 (2006)","journal-title":"Utilitas Mathematica"},{"issue":"3","key":"10_CR15","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":"10_CR16","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001","volume-title":"Invitation to Fixed-Parameter Algorithms","author":"R Niedermeier","year":"2006","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford University Press, Oxford (2006)"},{"key":"10_CR17","unstructured":"van Rooij, I.: Tractable cognition: complexity theory in cognitive psychology. Ph.D. thesis, University of Victoria, Canada (2003)"},{"issue":"17","key":"10_CR18","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. Discrete Appl. Math. 159(17), 2147\u20132164 (2011)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"10_CR19","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. Natl. Bureau Standards 82(3), 197\u2013202 (1977)","journal-title":"J. Res. Natl. Bureau Standards"},{"key":"10_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"249","DOI":"10.1007\/3-540-36136-7_23","volume-title":"Algorithms and Computation","author":"U Stege","year":"2002","unstructured":"Stege, U., van Rooij, I., Hertel, A., Hertel, P.: An O(pn + 1.151p)-algorithm for p-profit cover and its practical implications for vertex cover. In: Bose, P., Morin, P. (eds.) ISAAC 2002. LNCS, vol. 2518, pp. 249\u2013261. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-36136-7_23"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27195-4_10","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:16:14Z","timestamp":1709824574000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27195-4_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030271947","9783030271954"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27195-4_10","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":"1 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AAIM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Applications in Management","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Beijing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","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":"6 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"8 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aaim2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/theory.ict.ac.cn\/aaim2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}