skip to main content
OSTI.GOV title logo U.S. Department of Energy
Office of Scientific and Technical Information

Title: The Approximability of Partial Vertex Covers in Trees.

Book · · SOFSEM 2017: Theory and Practice of Computer Science
 [1];  [2];  [3];  [1]
  1. West Virginia Univ., Morgantown, WV (United States)
  2. Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
  3. Univ. of Haifa (Israel)

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.

Research Organization:
Sandia National Lab. (SNL-NM), Albuquerque, NM (United States)
Sponsoring Organization:
USDOE National Nuclear Security Administration (NNSA)
DOE Contract Number:
AC04-94AL85000
OSTI ID:
1427211
Report Number(s):
SAND-2015-2253J; 579434
Journal Information:
SOFSEM 2017: Theory and Practice of Computer Science, Other Information: ISBN 978-3-319-51962-3
Country of Publication:
United States
Language:
English

References (14)

Distributions on level-sets with applications to approximation algorithms conference January 2001
Using Homogeneous Weights for Approximating the Partial Cover Problem journal May 2001
Massaging a linear programming solution to give a 2-approximation for a generalization of the vertex cover problem book January 1998
A Primal-Dual Approximation Algorithm for Partial Vertex Cover: Making Educated Guesses journal October 2007
On the hardness of approximating vertex cover journal January 2005
Finding kth paths and p-centers by generating and searching good data structures journal March 1983
Reducibility among Combinatorial Problems book January 1972
Optimization, approximation, and complexity classes journal December 1991
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
Analytical models for risk-based intrusion response journal July 2013
Improved Approximation Algorithms for the Partial Vertex Cover Problem book January 2002
Approximation of Partial Capacitated Vertex Cover journal January 2010
The t-vertex cover problem: Extending the half integrality framework with budget constraints book January 1998
Approximation algorithms for partial covering problems journal October 2004

Similar Records

On Bipartite Graphs Trees and Their Partial Vertex Covers.
Journal Article · Sun Mar 01 00:00:00 EST 2015 · OSTI ID:1427211

One tree optimization problem
Conference · Sat Dec 31 00:00:00 EST 1994 · OSTI ID:1427211

Integral packing of trees and branchings
Journal Article · Fri Sep 01 00:00:00 EDT 1995 · Cybernetics and Systems Analysis · OSTI ID:1427211

Related Subjects