Abstract
We consider capacitated vertex cover with hard capacity (HCVC) on f-hypergraphs. In this problem, we are given a hypergraph \(G=(V,E)\) with a maximum edge size f. Each (hyper)edge is associated with a demand and each vertex is associated with a weight (cost), a capacity, and an available multiplicity. The objective is to find a minimum-weight vertex multiset, or cover, such that the demands of the edges can be met by the capacities of the vertices and the multiplicity of each vertex does not exceed its available multiplicity.
In this paper we present an O(f) bi-approximation for partial HCVC. As the demand served is at least the ratio of \((1-\epsilon )\), we have an \(O(1/\epsilon )f\)-approximation algorithm. This gives a parametric trade-off between the total demand to be covered and the cost of the resulting demand assignment.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. J. Algorithms 2(2), 198–203 (1981)
Cheung, W.-C., Goemans, M.X., Wong, S.C.-W.: Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs. In: Proceedings of the Twenty-Fifth Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2014, pp. 1714–1726 (2014)
Chuzhoy, J., Naor, J.S.: Covering problems with hard capacities. SIAM J. Comput. 36(2), 498–515 (2006)
Gandhi, R., Halperin, E., Khuller, S., Kortsarz, G., Srinivasan, A.: An improved approximation algorithm for vertex cover with hard capacities. In: Baeten, J.C.M., Lenstra, J.K., Parrow, J., Woeginger, G.J. (eds.) ICALP 2003. LNCS, vol. 2719, pp. 164–175. Springer, Heidelberg (2003). https://doi.org/10.1007/3-540-45061-0_15
Guha, S., Hassin, R., Khuller, S., Or, E.: Capacitated vertex covering. J. Algorithms 48(1), 257–270 (2003)
Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM J. Comput. 11(3), 555–556 (1982)
Kao, M.-J.: Iterative partial rounding for vertex cover with hard capacities. In: Proceedings of the Thirty-First Annual ACM-SIAM Symposium on Discrete Algorithms, SODA 2017 (2017)
Kao, M.-J., Liao, C.-S., Lee, D.T.: Capacitated domination problem. Algorithmica 60(2), 274–300 (2011)
Khot, S., Regev, O.: Vertex cover might be hard to approximate to within 2-epsilon. J. Comput. Syst. Sci. 74(3), 335–349 (2008)
Saha, B., Khuller, S.: Set cover revisited: hypergraph cover with hard capacities. In: Czumaj, A., Mehlhorn, K., Pitts, A., Wattenhofer, R. (eds.) ICALP 2012. LNCS, vol. 7391, pp. 762–773. Springer, Heidelberg (2012). https://doi.org/10.1007/978-3-642-31594-7_64
Shiau, J.-Y., Kao, M.-J., Lin, C.-C., Lee, D.T.: Tight approximation for partial vertex cover with hard capacities. In: 28th International Symposium on Algorithms and Computation, ISAAC 2017, 9–12 December 2017, Phuket, Thailand, pp. 64:1–64:13 (2017)
Wolsey, L.A.: An analysis of the greedy algorithm for the submodular set covering problem. Combinatorica 2(4), 385–393 (1982)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Tu, HL., Kao, MJ., Lee, D.T. (2019). An O(f) Bi-approximation for Weighted Capacitated Covering with Hard Capacity. In: Chang, CY., Lin, CC., Lin, HH. (eds) New Trends in Computer Technologies and Applications. ICS 2018. Communications in Computer and Information Science, vol 1013. Springer, Singapore. https://doi.org/10.1007/978-981-13-9190-3_51
Download citation
DOI: https://doi.org/10.1007/978-981-13-9190-3_51
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-13-9189-7
Online ISBN: 978-981-13-9190-3
eBook Packages: Computer ScienceComputer Science (R0)