LIPIcs.ISAAC.2017.64.pdf
- Filesize: 0.5 MB
- 13 pages
Document
Tight Approximation for Partial Vertex Cover with Hard Capacities
Authors
-
Part of:
Volume:
28th International Symposium on Algorithms and Computation (ISAAC 2017)
Series: Leibniz International Proceedings in Informatics (LIPIcs)
Conference: International Symposium on Algorithms and Computation (ISAAC) - License:
Creative Commons Attribution 3.0 Unported license
- Publication Date: 2017-12-07
Cite As Get BibTex
Jia-Yau Shiau, Mong-Jen Kao, Ching-Chi Lin, and D. T. Lee. Tight Approximation for Partial Vertex Cover with Hard Capacities. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 64:1-64:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2017)
https://doi.org/10.4230/LIPIcs.ISAAC.2017.64
Abstract
We consider the partial vertex cover problem with hard capacity constraints (Partial VC-HC) on hypergraphs. In this problem we are given a hypergraph G=(V,E) with a maximum edge size f and a covering requirement R. Each edge is associated with a demand, and each vertex is associated with a capacity and an (integral) available multiplicity. The objective is to compute a minimum vertex multiset such that at least R units of demand from the edges are covered by the capacities of the vertices in the multiset and the multiplicity of each vertex does not exceed its available multiplicity. In this paper we present an f-approximation for this problem, improving over a previous result of (2f+2)(1+epsilon) by Cheung et al to the tight extent possible. Our new ingredient of this work is a generalized analysis on the extreme points of the natural LP, developed from previous works, and a strengthened LP lower-bound obtained for the optimal solutions.
Subject Classification
Keywords
- Approximation Algorithm
- Capacitated Vertex Cover
- Hard Capacities
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads
References
- Hyung-Chan An, Mohit Singh, and Ola Svensson. Lp-based algorithms for capacitated facility location. SIAM J. Comput., 46(1):272-306, 2017. URL: http://dx.doi.org/10.1137/151002320.
- R. Bar-Yehuda, G. Flysher, J. Mestre, and D. Rawitz. Approximation of partial capacitated vertex cover. SIAM Journal on Discrete Mathematics, 24(4):1441-1469, 2010. URL: http://dx.doi.org/10.1137/080728044.
- W.-C. Cheung, M. Goemans, and S. Wong. Improved algorithms for vertex cover with hard capacities on multigraphs and hypergraphs. In Proceedings of SODA'14, 2014. URL: http://dx.doi.org/10.1137/1.9781611973402.124.
- Julia Chuzhoy and Joseph Naor. Covering problems with hard capacities. SIAM Journal on Computing, 36(2):498-515, August 2006. URL: http://dx.doi.org/10.1137/S0097539703422479.
- R. Gandhi, E. Halperin, S. Khuller, G. Kortsarz, and A. Srinivasan. An improved approx algorithm for vertex cover with hard capacities. J. Comput. Syst. Sci., 72:16-33, 2006. URL: http://dx.doi.org/10.1016/j.jcss.2005.06.004.
- F. Grandoni, J. Könemann, A. Panconesi, and M. Sozio. A primal-dual bicriteria distributed algorithm for capacitated vertex cover. SIAM J. Comput., 38(3), 2008. URL: http://dx.doi.org/10.1137/06065310X.
- Sudipto Guha, Refael Hassin, Samir Khuller, and Einat Or. Capacitated vertex covering. Journal of Algorithms, 48(1):257-270, August 2003. URL: http://dx.doi.org/10.1016/S0196-6774(03)00053-1.
-
Mong-Jen Kao. An Algorithmic Approach to Local and Global Resource Allocations. PhD thesis, National Taiwan University, 2012.
- Mong-Jen Kao. Iterative partial rounding for vertex cover with hard capacities. In Proceedings of SODA'17, pages 2638-2653, 2017. URL: http://dl.acm.org/citation.cfm?id=3039686.3039860.
- Mong-Jen Kao, Han-Lin Chen, and D.T. Lee. Capacitated domination: Problem complexity and approximation algorithms. Algorithmica, November 2013. URL: http://dx.doi.org/10.1007/s00453-013-9844-6.
- Mong-Jen Kao, Chung-Shou Liao, and D. T. Lee. Capacitated domination problem. Algorithmica, 60(2):274-300, June 2011. URL: http://dx.doi.org/10.1007/s00453-009-9336-x.
- Mong-Jen Kao, Hai-Lun Tu, and D. T. Lee. O(f) bi-approximation for capacitated covering with hard capacities. In ISAAC'16, pages 40:1-40:12, 2016. URL: http://dx.doi.org/10.4230/LIPIcs.ISAAC.2016.40.
- Subhash Khot and Oded Regev. Vertex cover might be hard to approximate to within 2-ε. Journal of Computer and System Sciences, 74(3):335-349, May 2008. URL: http://dx.doi.org/10.1016/j.jcss.2007.06.019.
- Julián Mestre. A primal-dual approximation algorithm for partial vertex cover: Making educated guesses. Algorithmica, 55(1):227-239, 2009. URL: http://dx.doi.org/10.1007/s00453-007-9003-z.
- B. Saha and S. Khuller. Set cover revisited: Hypergraph cover with hard capacities. In Proceedings of ICALP'12, pages 762-773, 2012. URL: http://dx.doi.org/10.1007/978-3-642-31594-7_64.
- Sam Chiu-wai Wong. Tight algorithms for vertex cover with hard capacities on multigraphs and hypergraphs. In Proceedings of SODA'17, pages 2626-2637, 2017. URL: http://dl.acm.org/citation.cfm?id=3039686.3039859.