Abstract
We motivate and describe a new parameterized approximation paradigm which studies the interaction between performance ratio and running time for any parametrization of a given optimization problem. As a key tool, we introduce the concept of α-shrinking transformation, for α ≥ 1. Applying such transformation to a parameterized problem instance decreases the parameter value, while preserving approximation ratio of α (or α-fidelity).
For example, it is well-known that Vertex Cover cannot be approximated within any constant factor better than 2 [24] (under usual assumptions). Our parameterized α-approximation algorithm for k-Vertex Cover, parameterized by the solution size, has a running time of 1.273(2 − α)k, where the running time of the best FPT algorithm is 1.273k [10]. Our algorithms define a continuous tradeoff between running times and approximation ratios, allowing practitioners to appropriately allocate computational resources.
Moving even beyond the performance ratio, we call for a new type of approximative kernelization race. Our α-shrinking transformations can be used to obtain kernels which are smaller than the best known for a given problem. For the Vertex Cover problem we obtain a kernel size of 2(2 − α)k. The smaller “α-fidelity” kernels allow us to solve exactly problem instances more efficiently, while obtaining an approximate solution for the original instance.
We show that such transformations exist for several fundamental problems, including Vertex Cover, d-Hitting Set, Connected Vertex Cover and Steiner Tree. We note that most of our algorithms are easy to implement and are therefore practical in use.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Abu-Khzam, F.N.: Kernelization Algorithms for D-Hitting Set Problems. In: Dehne, F., Sack, J.-R., Zeh, N. (eds.) WADS 2007. LNCS, vol. 4619, pp. 434–445. Springer, Heidelberg (2007)
Bar-Yehuda, R.: One for the price of two: a unified approach for approximating covering problems. Algorithmica 27(2), 131–144 (2000)
Björklund, A., Husfeldt, T.: Inclusion–exclusion algorithms for counting set partitions. In: FOCS, pp. 575–582 (2006)
Björklund, A., Husfeldt, T., Kaski, P., Koivisto, M.: Fourier meets Möbius: fast subset convolution. In: STOC, pp. 67–74 (2007)
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óth, C.D. (eds.) WADS 2009. LNCS, vol. 5664, pp. 507–518. Springer, Heidelberg (2009)
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. 6506, pp. 390–402. Springer, Heidelberg (2010)
Brankovic, L., Fernau, H.: Parameterized Approximation Algorithms for Hitting Set. In: Solis-Oba, R., Persiano, G. (eds.) WAOA 2011. LNCS, vol. 7164, pp. 63–76. Springer, Heidelberg (2012)
Cai, L., Huang, X.: Fixed-parameter approximation: Conceptual framework and approximability results. Algorithmica 57(2), 398–412 (2010)
Chen, J., Kanj, I.A., Xia, G.: Improved Parameterized Upper Bounds for Vertex Cover. In: Královič, R., Urzyczyn, P. (eds.) MFCS 2006. LNCS, vol. 4162, pp. 238–249. Springer, Heidelberg (2006)
Chen, Y.-J., Grohe, M., Grüber, M.: On Parameterized Approximability. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol. 4169, pp. 109–120. Springer, Heidelberg (2006)
Cygan, M., Kowalik, L., Pilipczuk, M., Wykurz, M.: Exponential-time approximation of hard problems. CoRR abs/0810.4934 (2008)
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)
Downey, R.G., Fellows, M.R.: Parameterized Complexity. Springer (1999)
Downey, R.G., Fellows, M.R., Langston, M.A.: The computer journal special issue on parameterized complexity: Foreword by the guest editors. Comput. J. 51(1), 1–6 (2008)
Downey, R.G., Fellows, M.R., McCartin, C., Rosamond, F.A.: Parameterized approximation of dominating set problems. Inf. Process. Lett. 109(1), 68–70 (2008)
Downey, R.G., Thilikos, D.M.: Confronting intractability via parameters. Computer Science Review 5(4), 279–317 (2011)
Drescher, M., Vetta, A.: An approximation algorithm for the maximum leaf spanning arborescence problem. ACM Transactions on Algorithms 6(3) (2010)
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/
Fernau, H.: Saving on phases: Parametrized approximation for total vertex cover. In: IWOCA 2012 (2012)
Fernau, H.: A systematic approach to moderately exponential-time approximation schemes. Manusctript (2012)
Flum, J., Grohe, M.: Parameterized Complexity Theory. An EATCS Series: Texts in Theoretical computer Science. Springer (1998)
Grohe, M., Grüber, M.: Parameterized Approximability of the Disjoint Cycle Problem. In: Arge, L., Cachin, C., Jurdziński, T., Tarlecki, A. (eds.) ICALP 2007. LNCS, vol. 4596, pp. 363–374. Springer, Heidelberg (2007)
Hochbaum, D.S.: Approximation Algorithms for NP-Hard Problems. PWS Publishing Company (1997)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74(3), 335–349 (2008)
Marx, D.: Parameterized complexity and approximation algorithms. Comput. J. 51(1), 60–78 (2008)
Marx, D., Razgon, I.: Constant ratio fixed-parameter approximation of the edge multicut problem. Information Processing Letters 109(20), 1161–1166 (2009)
Niedermeier, R.: Invitation to Fixed-Parameter Algorithms. Oxford Lecture Series in Mathematics and Its Applications. Oxford Univerity Press (2006)
Parameterized Complexity community Wiki., http://fpt.wikidot.com/
van Bevern, R., Moser, H., Niedermeier, R.: Kernelization Through Tidying. In: López-Ortiz, A. (ed.) LATIN 2010. LNCS, vol. 6034, pp. 527–538. Springer, Heidelberg (2010)
Vassilevska, V., Williams, R., Woo, S.L.M.: Confronting hardness using a hybrid approach. In: SODA 2006, pp. 1–10 (2006)
Vazirani, V.V.: Approximation Algorithms. Springer (2001)
Wahlström, M.: Algorithms, Measures and Upper Bounds for Satisfiability and Related Problems. PhD thesis, Department of Computer and Information Science. Linkopings University, Sweden (2007)
Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press (2011)
Zuckerman, D.: Linear degree extractors and the inapproximability of max clique and chromatic number. In: STOC 2006, pp. 681–690 (2006)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2012 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Fellows, M.R., Kulik, A., Rosamond, F., Shachnai, H. (2012). Parameterized Approximation via Fidelity Preserving Transformations. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds) Automata, Languages, and Programming. ICALP 2012. Lecture Notes in Computer Science, vol 7391. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-31594-7_30
Download citation
DOI: https://doi.org/10.1007/978-3-642-31594-7_30
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-31593-0
Online ISBN: 978-3-642-31594-7
eBook Packages: Computer ScienceComputer Science (R0)