Abstract
A vertex cover of a graph is a set of vertices of the graph such that every edge has at least one endpoint in it. In this work, we study Weighted Vertex Cover with solution size as a parameter. Formally, in the \((k,W)\)-Vertex Cover problem, given a graph G, an integer k, a positive rational W, and a weight function \(w:V(G) \rightarrow \mathbb {Q}^+\), the question is whether G has a vertex cover of size at most k of weight at most W, with k being the parameter. An (a, b)-bi-criteria approximation algorithm for \((k,W)\)-Vertex Cover either produces a vertex cover S such that \(|S| \le a k\) and \(w(S) \le b W\), or decides that there is no vertex cover of size at most k of weight at most W. We obtain the following results.
-
A simple (2, 2)-bi-criteria approximation algorithm for \((k,W)\)-Vertex Cover in polynomial time by modifying the standard LP-rounding algorithm.
-
A simple exact parameterized algorithm for \((k,W)\)-Vertex Cover running in \(\mathcal {O}^*(1.4656^k)\) time (Here, the \(\mathcal {O}^*\) notation hides factors polynomial in n.).
-
A \((1+\epsilon ,2)\)-approximation algorithm for \((k,W)\)-Vertex Cover running in \(\mathcal {O}^*(1.4656^{(1-\epsilon )k})\) time.
-
A (1.5, 1.5)-approximation algorithm for \((k,W)\)-Vertex Cover running in \(\mathcal {O}^*(1.414^k)\) time.
-
A \((2-\delta ,2-\delta )\)-approximation algorithm for \((k,W)\)-Vertex Cover running in \(\mathcal {O}^*\left( \sum _{i=\frac{\delta k(1-2 \delta )}{1+2 \delta }}^{\frac{\delta k (1-2\delta )}{2 \delta }} {{\delta k+i} \atopwithdelims (){\delta k-\frac{2i \delta }{1-2 \delta }}}\right) \) time for any \(\delta < 0.5\). For example, for (1.75, 1.75) and (1.9, 1.9)-approximation algorithms, we get running times of \(\mathcal {O}^*(1.272^k)\) and \(\mathcal {O}^*(1.151^k)\) respectively.
Our algorithms (expectedly) do not improve upon the running times of the existing algorithms for the unweighted version of Vertex Cover. When compared to algorithms for the weighted version, our algorithms are the first ones to the best of our knowledge which work with arbitrary weights, and they perform well when the solution size is much smaller than the total weight of the desired solution.
S. Mandal: Supported by Council of Scientific and Industrial Research, India.
Ashutosh Rai: Supported by Science and Engineering Research Board (SERB) Grant SRG/2021/002412.
S. Saurabh: Supported by the European Research Council (ERC) under the European Union’s Horizon 2020 research and innovation programme (grant agreement No. 819416), and Swarnajayanti Fellowship (No. DST/SJF/MSA01/2017-18).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Similar content being viewed by others
References
Bourgeois, N., Escoffier, B., Paschos, V.T.: Approximation of max independent set, min vertex cover and related problems by moderately exponential algorithms. Discret. Appl. Math. 159(17), 1954–1970 (2011)
Brankovic, L., Fernau, H.: A novel parameterised approximation algorithm for minimum vertex cover. Theor. Comput. Sci. 511, 85–108 (2013)
Chen, J., Fomin, F.V., Liu, Y., Lu, S., Villanger, Y.: Improved algorithms for feedback vertex set problems. J. Comput. Syst. Sci. 74(7), 1188–1198 (2008)
Chen, J., Kanj, I.A., **a, G.: Improved upper bounds for vertex cover. Theoret. Comput. Sci. 411(40–42), 3736–3756 (2010)
Dinur, I., Khot, S., Kindler, G., Minzer, D., Safra, M.: Towards a proof of the 2-to-1 games conjecture? In: Proceedings of the 50th Annual ACM SIGACT Symposium on Theory of Computing, STOC 2018, Los Angeles, CA, USA, June 25–29, 2018, pp. 376–389. ACM (2018)
Feldmann, A.E., Karthik, C.S., Lee, E., Manurangsi, P.: A survey on approximation in parameterized complexity: hardness and algorithms. Algorithms 13(6), 146 (2020)
Fellows, M.R., Kulik, A., Rosamond, F.A., Shachnai, H.: Parameterized approximation via fidelity preserving transformations. J. Comput. Syst. Sci. 93, 30–40 (2018)
Fomin, F.V., Gaspers, S., Saurabh, S.: Branching and treewidth based exact algorithms. In: Asano, T. (ed.) ISAAC 2006. LNCS, vol. 4288, pp. 16–25. Springer, Heidelberg (2006). https://doi.org/10.1007/11940128_4
Galby, E., Marx, D., Schepper, P., Sharma, R., Tale, P.: Parameterized complexity of weighted multicut in trees. In: Bekos, M.A., Kaufmann, M. (eds.) Graph-Theoretic Concepts in Computer Science: 48th International Workshop, WG 2022, Tübingen, Germany, June 22–24, 2022, Revised Selected Papers, pp. 257–270. Springer International Publishing, Cham (2022). https://doi.org/10.1007/978-3-031-15914-5_19
Karp, R.M.: Reducibility among combinatorial problems. In: Proceedings of a symposium on the Complexity of Computer Computations, held March 20–22, 1972, pp. 85–103. The IBM Research Symposia Series, Plenum Press, New York (1972)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74(3), 335–349 (2008)
Kim, E.J., Kratsch, S., Pilipczuk, M., Wahlström, M.: Directed flow-augmentation. In: STOC ’22: 54th Annual ACM SIGACT Symposium on Theory of Computing, Rome, Italy, June 20–24, 2022, pp. 938–947. ACM (2022)
Kim, E.J., Pilipczuk, M., Sharma, R., Wahlström, M.: On weighted graph separation problems and flow-augmentation. CoRR abs/2208.14841 (2022)
Kulik, A., Shachnai, H.: Analysis of two-variable recurrence relations with application to parameterized approximations, pp. 762–773. IEEE (2020)
Nemhauser, G.L., Trotter, L.E.: Vertex packings: structural properties and algorithms. Math. Program. 8(1), 232–248 (1975)
Niedermeier, R., Rossmanith, P.: On efficient fixed-parameter algorithms for weighted vertex cover. J. Algorithms 47(2), 63–77 (2003)
Saurabh, S.: What’s next? future directions in parameterized complexity. Recent Advances in Parameterized Complexity school, Tel Aviv (December (2017)
Shachnai, H., Zehavi, M.: A multivariate framework for weighted FPT algorithms. J. Comput. Syst. Sci. 89, 157–189 (2017)
Acknowledgment
The third author would like to thank Andreas Emil Feldmann and Cornelius Brand for some initial discussions on the problem.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2024 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this paper
Cite this paper
Mandal, S., Misra, P., Rai, A., Saurabh, S. (2024). Parameterized Approximation Algorithms for Weighted Vertex Cover. In: Soto, J.A., Wiese, A. (eds) LATIN 2024: Theoretical Informatics. LATIN 2024. Lecture Notes in Computer Science, vol 14579. Springer, Cham. https://doi.org/10.1007/978-3-031-55601-2_12
Download citation
DOI: https://doi.org/10.1007/978-3-031-55601-2_12
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-031-55600-5
Online ISBN: 978-3-031-55601-2
eBook Packages: Computer ScienceComputer Science (R0)