{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,3]],"date-time":"2025-11-03T22:57:14Z","timestamp":1762210634118},"reference-count":40,"publisher":"Springer Science and Business Media LLC","issue":"1-2","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2012,6]]},"DOI":"10.1007\/s00453-011-9559-5","type":"journal-article","created":{"date-parts":[[2011,8,30]],"date-time":"2011-08-30T14:48:57Z","timestamp":1314715737000},"page":"532-550","source":"Crossref","is-referenced-by-count":13,"title":["Polynomial Kernelizations for MIN F+\u03a01 and MAX NP"],"prefix":"10.1007","volume":"63","author":[{"given":"Stefan","family":"Kratsch","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2011,8,31]]},"reference":[{"issue":"7","key":"9559_CR1","doi-asserted-by":"crossref","first-page":"524","DOI":"10.1016\/j.jcss.2009.09.002","volume":"76","author":"F.N. Abu-Khzam","year":"2010","unstructured":"Abu-Khzam, F.N.: A kernelization algorithm for d-hitting set. J. Comput. Syst. Sci. 76(7), 524\u2013531 (2010)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9559_CR2","doi-asserted-by":"crossref","first-page":"501","DOI":"10.1145\/278298.278306","volume":"45","author":"S. Arora","year":"1998","unstructured":"Arora, S., Lund, C., Motwani, R., Sudan, M., Szegedy, M.: Proof verification and the hardness of approximation problems. J. ACM 45(3), 501\u2013555 (1998)","journal-title":"J. ACM"},{"issue":"3","key":"9559_CR3","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1137\/S0895480196305124","volume":"12","author":"V. Bafna","year":"1999","unstructured":"Bafna, V., Berman, P., Fujito, T.: A 2-approximation algorithm for the undirected feedback vertex set problem. SIAM J. Discrete Math. 12(3), 289\u2013297 (1999)","journal-title":"SIAM J. Discrete Math."},{"key":"9559_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1007\/978-3-642-11269-0_2","volume-title":"Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Revised Selected Papers","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L.: Kernelization: new upper and lower bound techniques. In: Chen, J., Fomin, F.V. (eds.) Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Revised Selected Papers, Copenhagen, Denmark, 10\u201311 September 2009. Lecture Notes in Computer Science, vol. 5917, pp. 17\u201337. Springer, Berlin (2009)"},{"key":"9559_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"635","DOI":"10.1007\/978-3-642-04128-0_57","volume-title":"ESA","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Thomass\u00e9, S., Yeo, A.: Kernel bounds for disjoint cycles and disjoint paths. In: Fiat, A., Sanders, P. (eds.) ESA. Lecture Notes in Computer Science, vol. 5757, pp. 635\u2013646. Springer, Berlin (2009)"},{"key":"9559_CR6","first-page":"629","volume-title":"FOCS","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Fomin, F.V., Lokshtanov, D., Penninkx, E., Saurabh, S., Thilikos, D.M.: (Meta) Kernelization. In: FOCS, pp. 629\u2013638. IEEE Computer Society, Los Alamitos (2009)"},{"issue":"8","key":"9559_CR7","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1016\/j.jcss.2009.04.001","volume":"75","author":"H.L. Bodlaender","year":"2009","unstructured":"Bodlaender, H.L., Downey, R.G., Fellows, M.R., Hermelin, D.: On problems without polynomial kernels. J. Comput. Syst. Sci. 75(8), 423\u2013434 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"3","key":"9559_CR8","doi-asserted-by":"crossref","first-page":"465","DOI":"10.1006\/jcss.1997.1490","volume":"54","author":"L. Cai","year":"1997","unstructured":"Cai, L., Chen, J.: On fixed-parameter tractability and approximability of NP optimization problems. J. Comput. Syst. Sci. 54(3), 465\u2013474 (1997)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9559_CR9","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1007\/s00453-008-9223-x","volume":"57","author":"L. Cai","year":"2010","unstructured":"Cai, L., Huang, X.: Fixed-parameter approximation: conceptual framework and approximability results. Algorithmica 57(2), 398\u2013412 (2010)","journal-title":"Algorithmica"},{"key":"9559_CR10","series-title":"Lecture Notes in Computer Science","volume-title":"Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Revised Selected Papers","year":"2009","unstructured":"Chen, J., Fomin, F.V. (eds.): Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Revised Selected Papers, Copenhagen, Denmark, 10\u201311 September 2009. Lecture Notes in Computer Science, vol. 5917. Springer, Berlin (2009)"},{"issue":"2","key":"9559_CR11","doi-asserted-by":"crossref","first-page":"280","DOI":"10.1006\/jagm.2001.1186","volume":"41","author":"J. Chen","year":"2001","unstructured":"Chen, J., Kanj, I.A., Jia, W.: Vertex cover: further observations and further improvements. J. Algorithms 41(2), 280\u2013301 (2001)","journal-title":"J. Algorithms"},{"key":"9559_CR12","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1145\/1806689.1806725","volume-title":"STOC","author":"H. Dell","year":"2010","unstructured":"Dell, H., van Melkebeek, D.: Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses. In: Schulman, L.J. (ed.) STOC, pp. 251\u2013260. ACM, New York (2010)"},{"key":"9559_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"378","DOI":"10.1007\/978-3-642-02927-1_32","volume-title":"ICALP (1)","author":"M. Dom","year":"2009","unstructured":"Dom, M., Lokshtanov, D., Saurabh, S.: Incompressibility through colors and ids. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S.E., Thomas, W. (eds.) ICALP (1). Lecture Notes in Computer Science, vol. 5555, pp. 378\u2013389. Springer, Berlin (2009)"},{"key":"9559_CR14","series-title":"Monographs in Computer Science","volume-title":"Parameterized Complexity","author":"R.G. Downey","year":"1998","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Monographs in Computer Science. Springer, Berlin (1998)"},{"key":"9559_CR15","doi-asserted-by":"crossref","first-page":"85","DOI":"10.1112\/jlms\/s1-35.1.85","volume":"35","author":"P. Erd\u0151s","year":"1960","unstructured":"Erd\u0151s, P., Rado, R.: Intersection theorems for systems of sets. J. Lond. Math. Soc. 35, 85\u201390 (1960)","journal-title":"J. Lond. Math. Soc."},{"key":"9559_CR16","series-title":"SIAM-AMS Proceedings","first-page":"43","volume-title":"Complexity of Computation","author":"R. Fagin","year":"1974","unstructured":"Fagin, R.: Generalized first-order spectra and polynomial-time recognizable sets. In: Complexity of Computation. SIAM-AMS Proceedings, vol. 7, pp. 43\u201373. SIAM, Philadelphia (1974)"},{"issue":"2","key":"9559_CR17","doi-asserted-by":"crossref","first-page":"629","DOI":"10.1137\/05064299X","volume":"38","author":"U. Feige","year":"2008","unstructured":"Feige, U., Hajiaghayi, M., Lee, J.R.: Improved approximation algorithms for minimum weight vertex separators. SIAM J. Comput. 38(2), 629\u2013657 (2008)","journal-title":"SIAM J. Comput."},{"key":"9559_CR18","series-title":"Dagstuhl Seminar Proceedings","first-page":"421","volume-title":"STACS","author":"H. Fernau","year":"2009","unstructured":"Fernau, H., Fomin, F.V., Lokshtanov, D., Raible, D., Saurabh, S., Villanger, Y.: Kernel(s) for problems with no kernel: on out-trees with many leaves. In: Albers, S., Marion, J.-Y. (eds.) STACS. Dagstuhl Seminar Proceedings, vol. 09001, pp. 421\u2013432. Schloss Dagstuhl\u2014Leibniz-Zentrum fuer Informatik, Germany (2009)"},{"key":"9559_CR19","series-title":"Texts in Theoretical Computer Science. An Eatcs Series","volume-title":"Parameterized Complexity Theory","author":"J. Flum","year":"2006","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. Texts in Theoretical Computer Science. An Eatcs Series. Springer, Berlin (2006)"},{"key":"9559_CR20","first-page":"503","volume-title":"SODA","author":"F.V. Fomin","year":"2010","unstructured":"Fomin, F.V., Lokshtanov, D., Saurabh, S., Thilikos, D.M.: Bidimensionality and kernels. In: Charikar, M. (ed.) SODA, pp. 503\u2013510. SIAM, Philadelphia (2010)"},{"issue":"1","key":"9559_CR21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/j.jcss.2010.06.007","volume":"77","author":"L. Fortnow","year":"2011","unstructured":"Fortnow, L., Santhanam, R.: Infeasibility of instance compression and succinct PCPs for NP. J. Comput. Syst. Sci. 77(1), 91\u2013106 (2011)","journal-title":"J. Comput. Syst. Sci."},{"key":"9559_CR22","volume-title":"Computers and Intractability: A Guide to the Theory of Np-completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of Np-completeness. Freeman, New York (1979)"},{"issue":"1","key":"9559_CR23","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1145\/1233481.1233493","volume":"38","author":"J. Guo","year":"2007","unstructured":"Guo, J., Niedermeier, R.: Invitation to data reduction and problem kernelization. SIGACT News 38(1), 31\u201345 (2007)","journal-title":"SIGACT News"},{"issue":"5","key":"9559_CR24","doi-asserted-by":"crossref","first-page":"1608","DOI":"10.1137\/S0097539700381097","volume":"31","author":"E. Halperin","year":"2002","unstructured":"Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM J. Comput. 31(5), 1608\u20131623 (2002)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9559_CR25","doi-asserted-by":"crossref","first-page":"164","DOI":"10.1137\/S0097539795286612","volume":"28","author":"S. Khanna","year":"1998","unstructured":"Khanna, S., Motwani, R., Sudan, M., Vazirani, U.V.: On syntactic versus computational views of approximability. SIAM J. Comput. 28(1), 164\u2013191 (1998)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9559_CR26","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1006\/inco.1994.1100","volume":"115","author":"P.G. Kolaitis","year":"1994","unstructured":"Kolaitis, P.G., Thakur, M.N.: Logical definability of NP optimization problems. Inf. Comput. 115(2), 321\u2013353 (1994)","journal-title":"Inf. Comput."},{"issue":"3","key":"9559_CR27","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1006\/jcss.1995.1031","volume":"50","author":"P.G. Kolaitis","year":"1995","unstructured":"Kolaitis, P.G., Thakur, M.N.: Approximation properties of NP minimization classes. J. Comput. Syst. Sci. 50(3), 391\u2013411 (1995)","journal-title":"J. Comput. Syst. Sci."},{"key":"9559_CR28","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1007\/978-3-642-11269-0_22","volume-title":"Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Revised Selected Papers","author":"S. Kratsch","year":"2009","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Two edge modification problems without polynomial kernels. In: Chen, J., Fomin, F.V. (eds.) Parameterized and Exact Computation, 4th International Workshop, IWPEC 2009, Revised Selected Papers, Copenhagen, Denmark, 10\u201311 September 2009. Lecture Notes in Computer Science, vol. 5917, pp. 264\u2013275. Springer, Berlin (2009)"},{"key":"9559_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/978-3-642-14165-2_55","volume-title":"ICALP (1)","author":"S. Kratsch","year":"2010","unstructured":"Kratsch, S., Wahlstr\u00f6m, M.: Preprocessing of min ones problems: a dichotomy. In: Abramsky, S., Gavoille, C., Kirchner, C., auf\u00a0der Heide, F.M., Spirakis, P.G. (eds.) ICALP (1). Lecture Notes in Computer Science, vol. 6198, pp. 653\u2013665. Springer, Berlin (2010)"},{"key":"9559_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"489","DOI":"10.1007\/978-3-642-15155-2_43","volume-title":"MFCS","author":"S. Kratsch","year":"2010","unstructured":"Kratsch, S., Marx, D., Wahlstr\u00f6m, M.: Parameterized complexity and kernelizability of max ones and exact ones problems. In: Hlinen\u00fd, P., Kucera, A. (eds.) MFCS. Lecture Notes in Computer Science, vol. 6281, pp. 489\u2013500. Springer, Berlin (2010)"},{"key":"9559_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"38","DOI":"10.1007\/11847250_4","volume-title":"IWPEC","author":"M. Mahajan","year":"2006","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing MAX SNP problems above guaranteed values. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC. Lecture Notes in Computer Science, vol. 4169, pp. 38\u201349. Springer, Berlin (2006)"},{"issue":"2","key":"9559_CR32","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/j.jcss.2008.08.004","volume":"75","author":"M. Mahajan","year":"2009","unstructured":"Mahajan, M., Raman, V., Sikdar, S.: Parameterizing above or below guaranteed values. J. Comput. Syst. Sci. 75(2), 137\u2013153 (2009)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9559_CR33","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/s00224-007-9089-3","volume":"43","author":"D. M\u00f6lle","year":"2008","unstructured":"M\u00f6lle, D., Richter, S., Rossmanith, P.: Enumerate and expand: improved algorithms for connected vertex cover and tree cover. Theory Comput. Syst. 43(2), 234\u2013253 (2008)","journal-title":"Theory Comput. Syst."},{"issue":"4","key":"9559_CR34","doi-asserted-by":"crossref","first-page":"1067","DOI":"10.1137\/S0097539798336073","volume":"30","author":"A. Natanzon","year":"2000","unstructured":"Natanzon, A., Shamir, R., Sharan, R.: A polynomial approximation algorithm for the minimum fill-in problem. SIAM J. Comput. 30(4), 1067\u20131079 (2000)","journal-title":"SIAM J. Comput."},{"key":"9559_CR35","series-title":"Oxford Lecture Series in Mathematics and Its Applications","doi-asserted-by":"crossref","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 Lecture Series in Mathematics and Its Applications. Oxford University Press, London (2006)"},{"key":"9559_CR36","volume-title":"Computational Complexity","author":"C.H. Papadimitriou","year":"1993","unstructured":"Papadimitriou, C.H.: Computational Complexity. Addison Wesley, Reading (1993)"},{"issue":"3","key":"9559_CR37","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"Papadimitriou, C.H., Yannakakis, M.: Optimization, approximation, and complexity classes. J. Comput. Syst. Sci. 43(3), 425\u2013440 (1991)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"9559_CR38","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/0020-0190(82)90022-9","volume":"14","author":"C.D. Savage","year":"1982","unstructured":"Savage, C.D.: Depth-first search and the vertex cover problem. Inf. Process. Lett. 14(5), 233\u2013237 (1982)","journal-title":"Inf. Process. Lett."},{"key":"9559_CR39","doi-asserted-by":"crossref","first-page":"579","DOI":"10.1002\/1520-6750(199406)41:4<579::AID-NAV3220410409>3.0.CO;2-G","volume":"41","author":"D. Simchi-Levi","year":"1994","unstructured":"Simchi-Levi, D.: New worst-case results for the bin-packing problem. Nav. Res. Logist. 41, 579\u2013585 (1994)","journal-title":"Nav. Res. Logist."},{"key":"9559_CR40","first-page":"115","volume-title":"SODA","author":"S. Thomass\u00e9","year":"2009","unstructured":"Thomass\u00e9, S.: A quadratic kernel for feedback vertex set. In: Mathieu, C. (ed.) SODA, pp. 115\u2013119. SIAM, Philadelphia (2009)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/www.springerlink.com\/index\/pdf\/10.1007\/s00453-011-9559-5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,20]],"date-time":"2017-06-20T01:24:08Z","timestamp":1497921848000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-011-9559-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,8,31]]},"references-count":40,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2012,6]]}},"alternative-id":["9559"],"URL":"https:\/\/doi.org\/10.1007\/s00453-011-9559-5","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011,8,31]]}}}