{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:03:45Z","timestamp":1725455025712},"publisher-location":"Berlin, Heidelberg","reference-count":37,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642334740"},{"type":"electronic","value":"9783642334757"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-33475-7_21","type":"book-chapter","created":{"date-parts":[[2012,9,8]],"date-time":"2012-09-08T02:43:09Z","timestamp":1347072189000},"page":"295-309","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Algorithms for the max k -vertex cover Problem"],"prefix":"10.1007","author":[{"given":"Federico","family":"Della Croce","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"21_CR1","doi-asserted-by":"publisher","first-page":"308","DOI":"10.1016\/0196-6774(91)90006-K","volume":"12","author":"S. Arnborg","year":"1991","unstructured":"Arnborg, S., Lagergren, J., Seese, D.: Easy problems for tree-decomposable graphs. J. Algorithms\u00a012(2), 308\u2013340 (1991)","journal-title":"J. Algorithms"},{"issue":"2","key":"21_CR2","doi-asserted-by":"publisher","first-page":"546","DOI":"10.1137\/070683933","volume":"39","author":"A. Bj\u00f6rklund","year":"2009","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Koivisto, M.: Set partitioning via inclusion-exclusion. SIAM J. Comput.\u00a039(2), 546\u2013563 (2009)","journal-title":"SIAM J. Comput."},{"issue":"6","key":"21_CR3","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1016\/S0020-0190(02)00434-9","volume":"85","author":"M. Bl\u00e4ser","year":"2003","unstructured":"Bl\u00e4ser, M.: Computing small partial coverings. Inform. Process. Lett.\u00a085(6), 327\u2013331 (2003)","journal-title":"Inform. Process. Lett."},{"key":"21_CR4","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: Efficient approximation by \u201clow-complexity\u201d exponential algorithms. Cahier du LAMSADE 271, LAMSADE, Universit\u00e9 Paris-Dauphine (December 2007), \n                  \n                    http:\/\/www.lamsade.dauphine.fr\/cahiers\/PDF\/cahierLamsade271.pdf"},{"key":"21_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"507","DOI":"10.1007\/978-3-642-03367-4_44","volume-title":"Algorithms and Data Structures","author":"N. Bourgeois","year":"2009","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: Efficient Approximation of Combinatorial Problems by Moderately Exponential Algorithms. In: Dehne, F., Gavrilova, M., Sack, J.-R., T\u00f3th, C.D. (eds.) WADS 2009. LNCS, vol.\u00a05664, pp. 507\u2013518. Springer, Heidelberg (2009)"},{"issue":"16","key":"21_CR6","doi-asserted-by":"publisher","first-page":"950","DOI":"10.1016\/j.ipl.2009.05.002","volume":"109","author":"N. Bourgeois","year":"2009","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: Efficient approximation of min coloring by moderately exponential algorithms. Inform. Process. Lett.\u00a0109(16), 950\u2013954 (2009)","journal-title":"Inform. Process. Lett."},{"issue":"21-23","key":"21_CR7","doi-asserted-by":"publisher","first-page":"2184","DOI":"10.1016\/j.tcs.2009.02.007","volume":"410","author":"N. Bourgeois","year":"2009","unstructured":"Bourgeois, N., Escoffier, B., Paschos, V.T.: Efficient approximation of min set cover by moderately exponential algorithms. Theoret. Comput. Sci.\u00a0410(21-23), 2184\u20132195 (2009)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR8","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1017\/S030500410002168X","volume":"37","author":"R.L. Brooks","year":"1941","unstructured":"Brooks, R.L.: On coloring the nodes of a network. Math. Proc. Cambridge Philos. Soc.\u00a037, 194\u2013197 (1941)","journal-title":"Math. Proc. Cambridge Philos. Soc."},{"key":"21_CR9","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1093\/comjnl\/bxm086","volume":"51","author":"L. Cai","year":"2008","unstructured":"Cai, L.: Parameter complexity of cardinality constrained optimization problems. The Computer Journal\u00a051, 102\u2013121 (2008)","journal-title":"The Computer Journal"},{"key":"21_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1007\/11847250_9","volume-title":"Parameterized and Exact Computation","author":"L. Cai","year":"2006","unstructured":"Cai, L., Huang, X.: Fixed-Parameter Approximation: Conceptual Framework and Approximability Results. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 96\u2013108. Springer, Heidelberg (2006)"},{"key":"21_CR11","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms\u00a041, 280\u2013301 (2001)","journal-title":"J. Algorithms"},{"issue":"40-42","key":"21_CR12","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., Xia, G.: Improved upper bounds for vertex cover. Theoret. Comput. Sci.\u00a0411(40-42), 3736\u20133756 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR13","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1016\/0890-5401(90)90043-H","volume":"85","author":"B. Courcelle","year":"1990","unstructured":"Courcelle, B.: The monadic second-order logic of graphs. i. recognizable sets of finite graphs. Information and Computation\u00a085, 12\u201375 (1990)","journal-title":"Information and Computation"},{"key":"21_CR14","unstructured":"Croce, F.D., Paschos, V.T.: On the max k-vertex cover problem. Cahier du LAMSADE 307, LAMSADE, Universit\u00e9 Paris-Dauphine (2011)"},{"issue":"16","key":"21_CR15","doi-asserted-by":"publisher","first-page":"957","DOI":"10.1016\/j.ipl.2009.05.003","volume":"109","author":"M. Cygan","year":"2009","unstructured":"Cygan, M., Kowalik, L., Wykurz, M.: Exponential-time approximation of weighted set cover. Inform. Process. Lett.\u00a0109(16), 957\u2013961 (2009)","journal-title":"Inform. Process. Lett."},{"issue":"40\u201342","key":"21_CR16","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.\u00a0411(40\u201342), 3701\u20133713 (2010)","journal-title":"Theoret. Comput. Sci."},{"key":"21_CR17","series-title":"Monographs in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-0515-9","volume-title":"Parameterized complexity","author":"R.G. Downey","year":"1999","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized complexity. Monographs in Computer Science. Springer, New York (1999)"},{"key":"21_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/11847250_11","volume-title":"Parameterized and Exact Computation","author":"R.G. Downey","year":"2006","unstructured":"Downey, R.G., Fellows, M.R., McCartin, C.: Parameterized Approximation Problems. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 121\u2013129. Springer, Heidelberg (2006)"},{"issue":"2","key":"21_CR19","doi-asserted-by":"publisher","first-page":"174","DOI":"10.1006\/jagm.2001.1183","volume":"41","author":"U. Feige","year":"2001","unstructured":"Feige, U., Langberg, M.: Approximation algorithms for maximization problems arising in graph partitioning. J. Algorithms\u00a041(2), 174\u2013211 (2001)","journal-title":"J. Algorithms"},{"key":"21_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"2","DOI":"10.1007\/978-3-642-10217-2_2","volume-title":"Combinatorial Algorithms","author":"M. Fellows","year":"2009","unstructured":"Fellows, M.: Towards Fully Multivariate Algorithmics: Some New Results and Directions in Parameter Ecology. In: Fiala, J., Kratochv\u00edl, J., Miller, M. (eds.) IWOCA 2009. LNCS, vol.\u00a05874, pp. 2\u201310. Springer, Heidelberg (2009)"},{"key":"21_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"294","DOI":"10.1007\/978-3-540-92182-0_28","volume-title":"Algorithms and Computation","author":"M.R. Fellows","year":"2008","unstructured":"Fellows, M.R., Lokshtanov, D., Misra, N., Rosamond, F.A., Saurabh, S.: Graph Layout Problems Parameterized by Vertex Cover. In: Hong, S.-H., Nagamochi, H., Fukunaga, T. (eds.) ISAAC 2008. LNCS, vol.\u00a05369, pp. 294\u2013305. Springer, Heidelberg (2008)"},{"issue":"5","key":"21_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/1552285.1552286","volume":"56","author":"F. Fomin","year":"2009","unstructured":"Fomin, F., Grandoni, F., Kratsch, D.: A measure\u00a0& conquer approach for the analysis of exact algorithms. J. Assoc. Comput. Mach.\u00a056(5), 1\u201332 (2009)","journal-title":"J. Assoc. Comput. Mach."},{"issue":"5","key":"21_CR23","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1016\/j.ipl.2005.10.012","volume":"97","author":"F.V. Fomin","year":"2006","unstructured":"Fomin, F.V., H\u00f8ie, K.: Pathwidth of cubic graphs and exact algorithms. Inform. Process. Lett.\u00a097(5), 191\u2013196 (2006)","journal-title":"Inform. Process. Lett."},{"issue":"16","key":"21_CR24","doi-asserted-by":"publisher","first-page":"814","DOI":"10.1016\/j.ipl.2011.05.016","volume":"111","author":"F.V. Fomin","year":"2011","unstructured":"Fomin, F.V., Lokshtanov, D., Raman, V., Saurabh, S.: Subexponential algorithms for partial cover problems. Inform. Process. Lett.\u00a0111(16), 814\u2013818 (2011)","journal-title":"Inform. Process. Lett."},{"key":"21_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"210","DOI":"10.1007\/978-3-540-70575-8_18","volume-title":"Automata, Languages and Programming","author":"F.V. Fomin","year":"2008","unstructured":"Fomin, F.V., Villanger, Y.: Treewidth Computation and Extremal Combinatorics. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 210\u2013221. Springer, Heidelberg (2008)"},{"key":"21_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"173","DOI":"10.1007\/978-3-642-11269-0_14","volume-title":"Parameterized and Exact Computation","author":"M. F\u00fcrer","year":"2009","unstructured":"F\u00fcrer, M., Gaspers, S., Kasiviswanathan, S.P.: An Exponential Time 2-Approximation Algorithm for Bandwidth. In: Chen, J., Fomin, F.V. (eds.) IWPEC 2009. LNCS, vol.\u00a05917, pp. 173\u2013184. Springer, Heidelberg (2009)"},{"key":"21_CR27","volume-title":"Computers and intractability","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and intractability. W. H. Freeman, San Francisco (1979)"},{"key":"21_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1007\/11534273_5","volume-title":"Algorithms and Data Structures","author":"J. Guo","year":"2005","unstructured":"Guo, J., Niedermeier, R., Wernicke, S.: Parameterized Complexity of Generalized Vertex Cover Problems. In: Dehne, F., L\u00f3pez-Ortiz, A., Sack, J.-R. (eds.) WADS 2005. LNCS, vol.\u00a03608, pp. 36\u201348. Springer, Heidelberg (2005)"},{"issue":"4","key":"21_CR29","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. System Sci.\u00a063(4), 512\u2013530 (2001)","journal-title":"J. Comput. System Sci."},{"issue":"2","key":"21_CR30","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/s10878-005-2269-7","volume":"10","author":"G. J\u00e4ger","year":"2005","unstructured":"J\u00e4ger, G., Srivastav, A.: Improved approximation algorithms for maximum graph partitioning problems. J. Comb. Optim.\u00a010(2), 133\u2013167 (2005)","journal-title":"J. Comb. Optim."},{"key":"21_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"240","DOI":"10.1007\/978-3-540-92248-3_22","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"J. Kneis","year":"2008","unstructured":"Kneis, J., Langer, A., Rossmanith, P.: Improved Upper Bounds for Partial Vertex Cover. In: Broersma, H., Erlebach, T., Friedetzky, T., Paulusma, D. (eds.) WG 2008. LNCS, vol.\u00a05344, pp. 240\u2013251. Springer, Heidelberg (2008)"},{"issue":"1","key":"21_CR32","doi-asserted-by":"publisher","first-page":"60","DOI":"10.1093\/comjnl\/bxm048","volume":"51","author":"D. Marx","year":"2008","unstructured":"Marx, D.: Parameterized complexity and approximation algorithms. The Computer Journal\u00a051(1), 60\u201378 (2008)","journal-title":"The Computer Journal"},{"key":"21_CR33","unstructured":"Marx, D.: Fixed parameter algorithms. Open lectures for PhD students in computer science (January 2010)"},{"key":"21_CR34","unstructured":"Moser, H.: Exact algorithms for generalizations of vertex cover. Master\u2019s thesis, Fakult\u00e4t f\u00fcr Mathematik und Informatik, Friedrich-Schiller-Universit\u00e4t Jena (2005)"},{"key":"21_CR35","unstructured":"Ne\u0161et\u0159il, J., Poljak, S.: On the complexity of the subgraph problem. Comment. Math. Univ. Carolinae, 415\u2013419 (1985)"},{"issue":"2","key":"21_CR36","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1016\/S0196-6774(03)00005-1","volume":"47","author":"R. Niedermeier","year":"2003","unstructured":"Niedermeier, R., Rossmanith, P.: On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms\u00a047(2), 63\u201377 (2003)","journal-title":"J. Algorithms"},{"key":"21_CR37","unstructured":"Praveen, M.: Logic, Courcelle\u2019s theorem and application. IMPECS School on Parameterized and Exact Computation (December 2010)"}],"container-title":["Lecture Notes in Computer Science","Theoretical Computer Science"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-33475-7_21","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,7]],"date-time":"2019-05-07T04:51:00Z","timestamp":1557204660000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-33475-7_21"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642334740","9783642334757"],"references-count":37,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-33475-7_21","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}