{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T16:02:41Z","timestamp":1725897761416},"publisher-location":"Berlin, Heidelberg","reference-count":34,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642315930"},{"type":"electronic","value":"9783642315947"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2012]]},"DOI":"10.1007\/978-3-642-31594-7_30","type":"book-chapter","created":{"date-parts":[[2012,6,22]],"date-time":"2012-06-22T21:20:21Z","timestamp":1340400021000},"page":"351-362","source":"Crossref","is-referenced-by-count":9,"title":["Parameterized Approximation via Fidelity Preserving Transformations"],"prefix":"10.1007","author":[{"given":"Michael R.","family":"Fellows","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ariel","family":"Kulik","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Frances","family":"Rosamond","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Hadas","family":"Shachnai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/978-3-540-73951-7_38","volume-title":"Algorithms and Data Structures","author":"F.N. Abu-Khzam","year":"2007","unstructured":"Abu-Khzam, F.N.: Kernelization Algorithms for D-Hitting Set Problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol.\u00a04619, pp. 434\u2013445. Springer, Heidelberg (2007)"},{"issue":"2","key":"30_CR2","doi-asserted-by":"publisher","first-page":"131","DOI":"10.1007\/s004530010009","volume":"27","author":"R. Bar-Yehuda","year":"2000","unstructured":"Bar-Yehuda, R.: One for the price of two: a unified approach for approximating covering problems. Algorithmica\u00a027(2), 131\u2013144 (2000)","journal-title":"Algorithmica"},{"key":"30_CR3","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T.: Inclusion\u2013exclusion algorithms for counting set partitions. In: FOCS, pp. 575\u2013582 (2006)","DOI":"10.1109\/FOCS.2006.41"},{"key":"30_CR4","doi-asserted-by":"crossref","unstructured":"Bj\u00f6rklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets M\u00f6bius: fast subset convolution. In: STOC, pp. 67\u201374 (2007)","DOI":"10.1145\/1250790.1250801"},{"key":"30_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)"},{"key":"30_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"390","DOI":"10.1007\/978-3-642-17517-6_35","volume-title":"Algorithms and Computation","author":"L. Brankovic","year":"2010","unstructured":"Brankovic, L., Fernau, H.: Combining Two Worlds: Parameterised Approximation for Vertex Cover. In: Cheong, O., Chwa, K.-Y., Park, K. (eds.) ISAAC 2010. LNCS, vol.\u00a06506, pp. 390\u2013402. Springer, Heidelberg (2010)"},{"key":"30_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1007\/978-3-642-29116-6_6","volume-title":"Approximation and Online Algorithms","author":"L. Brankovic","year":"2012","unstructured":"Brankovic, L., Fernau, H.: Parameterized Approximation Algorithms for Hitting Set. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol.\u00a07164, pp. 63\u201376. Springer, Heidelberg (2012)"},{"issue":"2","key":"30_CR8","doi-asserted-by":"publisher","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\u00a057(2), 398\u2013412 (2010)","journal-title":"Algorithmica"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"238","DOI":"10.1007\/11821069_21","volume-title":"Mathematical Foundations of Computer Science 2006","author":"J. Chen","year":"2006","unstructured":"Chen, J., Kanj, I.A., Xia, G.: Improved Parameterized Upper Bounds for Vertex Cover. In: Kr\u00e1lovi\u010d, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol.\u00a04162, pp. 238\u2013249. Springer, Heidelberg (2006)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"109","DOI":"10.1007\/11847250_10","volume-title":"Parameterized and Exact Computation","author":"Y.-J. Chen","year":"2006","unstructured":"Chen, Y.-J., Grohe, M., Gr\u00fcber, M.: On Parameterized Approximability. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 109\u2013120. Springer, Heidelberg (2006)"},{"key":"30_CR11","unstructured":"Cygan, M., Kowalik, L., Pilipczuk, M., Wykurz, M.: Exponential-time approximation of hard problems. CoRR abs\/0810.4934 (2008)"},{"key":"30_CR12","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. In: FOCS 2011 (2011)","DOI":"10.1109\/FOCS.2011.23"},{"key":"30_CR13","doi-asserted-by":"crossref","unstructured":"Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)","DOI":"10.1007\/978-1-4612-0515-9"},{"issue":"1","key":"30_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/comjnl\/bxm111","volume":"51","author":"R.G. Downey","year":"2008","unstructured":"Downey, R.G., Fellows, M.R., Langston, M.A.: The computer journal special issue on parameterized complexity: Foreword by the guest editors. Comput. J.\u00a051(1), 1\u20136 (2008)","journal-title":"Comput. J."},{"issue":"1","key":"30_CR15","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1016\/j.ipl.2008.09.017","volume":"109","author":"R.G. Downey","year":"2008","unstructured":"Downey, R.G., Fellows, M.R., McCartin, C., Rosamond, F.A.: Parameterized approximation of dominating set problems. Inf. Process. Lett.\u00a0109(1), 68\u201370 (2008)","journal-title":"Inf. Process. Lett."},{"issue":"4","key":"30_CR16","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1016\/j.cosrev.2011.09.002","volume":"5","author":"R.G. Downey","year":"2011","unstructured":"Downey, R.G., Thilikos, D.M.: Confronting intractability via parameters. Computer Science Review\u00a05(4), 279\u2013317 (2011)","journal-title":"Computer Science Review"},{"key":"30_CR17","doi-asserted-by":"crossref","unstructured":"Drescher, M., Vetta, A.: An approximation algorithm for the maximum leaf spanning arborescence problem. ACM Transactions on Algorithms\u00a06(3) (2010)","DOI":"10.1145\/1798596.1798599"},{"key":"30_CR18","unstructured":"Fellows, M.R., Kulik, A., Rosamond, F., Shachnai, H.: Parameterized approximation via fidelity preserving transformations. full version, http:\/\/www.cs.technion.ac.il\/~hadas\/PUB\/FKRS_approx_param.pdf\/"},{"key":"30_CR19","doi-asserted-by":"crossref","unstructured":"Fernau, H.: Saving on phases: Parametrized approximation for total vertex cover. In: IWOCA 2012 (2012)","DOI":"10.1007\/978-3-642-35926-2_3"},{"key":"30_CR20","unstructured":"Fernau, H.: A systematic approach to moderately exponential-time approximation schemes. Manusctript (2012)"},{"key":"30_CR21","unstructured":"Flum, J., Grohe, M.: Parameterized Complexity Theory. An EATCS Series: Texts in Theoretical computer Science. Springer (1998)"},{"key":"30_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-540-73420-8_33","volume-title":"Automata, Languages and Programming","author":"M. Grohe","year":"2007","unstructured":"Grohe, M., Gr\u00fcber, M.: Parameterized Approximability of the Disjoint Cycle Problem. In: Arge, L., Cachin, C., Jurdzi\u0144ski, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol.\u00a04596, pp. 363\u2013374. Springer, Heidelberg (2007)"},{"key":"30_CR23","doi-asserted-by":"crossref","unstructured":"Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company (1997)","DOI":"10.1145\/261342.571216"},{"issue":"3","key":"30_CR24","doi-asserted-by":"publisher","first-page":"335","DOI":"10.1016\/j.jcss.2007.06.019","volume":"74","author":"S. Khot","year":"2008","unstructured":"Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci.\u00a074(3), 335\u2013349 (2008)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"30_CR25","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. Comput. J.\u00a051(1), 60\u201378 (2008)","journal-title":"Comput. J."},{"issue":"20","key":"30_CR26","doi-asserted-by":"publisher","first-page":"1161","DOI":"10.1016\/j.ipl.2009.07.016","volume":"109","author":"D. Marx","year":"2009","unstructured":"Marx, D., Razgon, I.: Constant ratio fixed-parameter approximation of the edge multicut problem. Information Processing Letters\u00a0109(20), 1161\u20131166 (2009)","journal-title":"Information Processing Letters"},{"key":"30_CR27","doi-asserted-by":"crossref","unstructured":"Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford Univerity Press (2006)","DOI":"10.1093\/acprof:oso\/9780198566076.001.0001"},{"key":"30_CR28","unstructured":"Parameterized Complexity community Wiki., http:\/\/fpt.wikidot.com\/"},{"key":"30_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"527","DOI":"10.1007\/978-3-642-12200-2_46","volume-title":"LATIN 2010: Theoretical Informatics","author":"R. Bevern van","year":"2010","unstructured":"van Bevern, R., Moser, H., Niedermeier, R.: Kernelization Through Tidying. In: L\u00f3pez-Ortiz, A. (ed.) LATIN 2010. LNCS, vol.\u00a06034, pp. 527\u2013538. Springer, Heidelberg (2010)"},{"key":"30_CR30","doi-asserted-by":"crossref","unstructured":"Vassilevska, V., Williams, R., Woo, S.L.M.: Confronting hardness using a hybrid approach. In: SODA 2006, pp. 1\u201310 (2006)","DOI":"10.1145\/1109557.1109558"},{"key":"30_CR31","unstructured":"Vazirani, V.V.: Approximation Algorithms. Springer (2001)"},{"key":"30_CR32","unstructured":"Wahlstr\u00f6m, M.: Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems. PhD thesis, Department of Computer and Information Science. Linkopings University, Sweden (2007)"},{"key":"30_CR33","doi-asserted-by":"crossref","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)","DOI":"10.1017\/CBO9780511921735"},{"key":"30_CR34","doi-asserted-by":"crossref","unstructured":"Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: STOC 2006, pp. 681\u2013690 (2006)","DOI":"10.1145\/1132516.1132612"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages, and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-31594-7_30.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,24]],"date-time":"2020-11-24T03:08:35Z","timestamp":1606187315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-31594-7_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642315930","9783642315947"],"references-count":34,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-31594-7_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}