The Approximability of Partial Vertex Covers in Trees.
Abstract
Motivated by applications in risk management of computational systems, we focus our attention on a special case of the partial vertex cover problem, where the underlying graph is assumed to be a tree. Here, we consider four possible versions of this setting, depending on whether vertices and edges are weighted or not. Two of these versions, where edges are assumed to be unweighted, are known to be polynomial-time solvable (Gandhi, Khuller, and Srinivasan, 2004). However, the computational complexity of this problem with weighted edges, and possibly with weighted vertices, has not been determined yet. The main contribution of this paper is to resolve these questions, by fully characterizing which variants of partial vertex cover remain intractable in trees, and which can be efficiently solved. In particular, we propose a pseudo-polynomial DP-based algorithm for the most general case of having weights on both edges and vertices, which is proven to be NPhard. This algorithm provides a polynomial-time solution method when weights are limited to edges, and combined with additional scaling ideas, leads to an FPTAS for the general case. A secondary contribution of this work is to propose a novel way of using centroid decompositions in trees, which could be usefulmore »
- Authors:
-
- West Virginia Univ., Morgantown, WV (United States)
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Univ. of Haifa (Israel)
- Publication Date:
- Research Org.:
- Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
- Sponsoring Org.:
- USDOE National Nuclear Security Administration (NNSA)
- OSTI Identifier:
- 1427211
- Report Number(s):
- SAND-2015-2253J
579434
- DOE Contract Number:
- AC04-94AL85000
- Resource Type:
- Book
- Journal Name:
- SOFSEM 2017: Theory and Practice of Computer Science
- Additional Journal Information:
- Other Information: ISBN 978-3-319-51962-3
- Country of Publication:
- United States
- Language:
- English
- Subject:
- 97 MATHEMATICS AND COMPUTING
Citation Formats
Mkrtchyan, Vahan, Parekh, Ojas D., Segev, Danny, and Subramani, K. The Approximability of Partial Vertex Covers in Trees.. United States: N. p., 2017.
Web. doi:10.1007/978-3-319-51963-0_27.
Mkrtchyan, Vahan, Parekh, Ojas D., Segev, Danny, & Subramani, K. The Approximability of Partial Vertex Covers in Trees.. United States. https://doi.org/10.1007/978-3-319-51963-0_27
Mkrtchyan, Vahan, Parekh, Ojas D., Segev, Danny, and Subramani, K. 2017.
"The Approximability of Partial Vertex Covers in Trees.". United States. https://doi.org/10.1007/978-3-319-51963-0_27. https://www.osti.gov/servlets/purl/1427211.
@article{osti_1427211,
title = {The Approximability of Partial Vertex Covers in Trees.},
author = {Mkrtchyan, Vahan and Parekh, Ojas D. and Segev, Danny and Subramani, K.},
abstractNote = {Motivated by applications in risk management of computational systems, we focus our attention on a special case of the partial vertex cover problem, where the underlying graph is assumed to be a tree. Here, we consider four possible versions of this setting, depending on whether vertices and edges are weighted or not. Two of these versions, where edges are assumed to be unweighted, are known to be polynomial-time solvable (Gandhi, Khuller, and Srinivasan, 2004). However, the computational complexity of this problem with weighted edges, and possibly with weighted vertices, has not been determined yet. The main contribution of this paper is to resolve these questions, by fully characterizing which variants of partial vertex cover remain intractable in trees, and which can be efficiently solved. In particular, we propose a pseudo-polynomial DP-based algorithm for the most general case of having weights on both edges and vertices, which is proven to be NPhard. This algorithm provides a polynomial-time solution method when weights are limited to edges, and combined with additional scaling ideas, leads to an FPTAS for the general case. A secondary contribution of this work is to propose a novel way of using centroid decompositions in trees, which could be useful in other settings as well.},
doi = {10.1007/978-3-319-51963-0_27},
url = {https://www.osti.gov/biblio/1427211},
journal = {SOFSEM 2017: Theory and Practice of Computer Science},
number = ,
volume = ,
place = {United States},
year = {Wed Jan 11 00:00:00 EST 2017},
month = {Wed Jan 11 00:00:00 EST 2017}
}
Works referenced in this record:
Distributions on level-sets with applications to approximation algorithms
conference, January 2001
- Srinivasan, A.
- Proceedings 42nd IEEE Symposium on Foundations of Computer Science
Using Homogeneous Weights for Approximating the Partial Cover Problem
journal, May 2001
- Bar-Yehuda, Reuven
- Journal of Algorithms, Vol. 39, Issue 2
Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem
book, January 1998
- Bshouty, Nader H.; Burroughs, Lynn
- STACS 98
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses
journal, October 2007
- Mestre, Julián
- Algorithmica, Vol. 55, Issue 1
On the hardness of approximating vertex cover
journal, January 2005
- Dinur, Irit; Safra, Samuel
- Annals of Mathematics, Vol. 162, Issue 1
Finding kth paths and p-centers by generating and searching good data structures
journal, March 1983
- Frederickson, Greg N.; Johnson, Donald B.
- Journal of Algorithms, Vol. 4, Issue 1
Reducibility among Combinatorial Problems
book, January 1972
- Karp, Richard M.
- Complexity of Computer Computations
Optimization, approximation, and complexity classes
journal, December 1991
- Papadimitriou, Christos H.; Yannakakis, Mihalis
- Journal of Computer and System Sciences, Vol. 43, Issue 3
Vertex cover might be hard to approximate to within <mml:math altimg="si1.gif" overflow="scroll" xmlns:xocs="http://www.elsevier.com/xml/xocs/dtd" xmlns:xs="http://www.w3.org/2001/XMLSchema" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns="http://www.elsevier.com/xml/ja/dtd" xmlns:ja="http://www.elsevier.com/xml/ja/dtd" xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:tb="http://www.elsevier.com/xml/common/table/dtd" xmlns:sb="http://www.elsevier.com/xml/common/struct-bib/dtd" xmlns:ce="http://www.elsevier.com/xml/common/dtd" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:cals="http://www.elsevier.com/xml/common/cals/dtd"><mml:mn>2</mml:mn><mml:mo>−</mml:mo><mml:mi>ε</mml:mi></mml:math>
journal, May 2008
- Khot, Subhash; Regev, Oded
- Journal of Computer and System Sciences, Vol. 74, Issue 3
Analytical models for risk-based intrusion response
journal, July 2013
- Caskurlu, Bugra; Gehani, Ashish; Bilgin, Cemal Cagatay
- Computer Networks, Vol. 57, Issue 10
Improved Approximation Algorithms for the Partial Vertex Cover Problem
book, January 2002
- Halperin, Eran; Srinivasan, Aravind
- Approximation Algorithms for Combinatorial Optimization
Approximation of Partial Capacitated Vertex Cover
journal, January 2010
- Bar-Yehuda, Reuven; Flysher, Guy; Mestre, Julián
- SIAM Journal on Discrete Mathematics, Vol. 24, Issue 4
The t-vertex cover problem: Extending the half integrality framework with budget constraints
book, January 1998
- Hochbaum, Dorit S.
- Approximation Algorithms for Combinatiorial Optimization
Approximation algorithms for partial covering problems
journal, October 2004
- Gandhi, Rajiv; Khuller, Samir; Srinivasan, Aravind
- Journal of Algorithms, Vol. 53, Issue 1