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. 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 NP-hard. This algorithm provides a polynomialtime 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.
|Title of host publication||SOFSEM 2017|
|Subtitle of host publication||Theory and Practice of Computer Science - 43rd International Conference on Current Trends in Theory and Practice of Computer Science, Proceedings|
|Editors||Christel Baier, Mark van den Brand, Johann Eder, Mike Hinchey, Tiziana Margaria, Bernhard Steffen|
|Number of pages||11|
|State||Published - 2017|
|Event||43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017 - Limerick, Ireland|
Duration: 16 Jan 2017 → 20 Jan 2017
|Name||Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)|
|Conference||43rd Conference on Current Trends in Theory and Practice of Computer Science, SOFSEM 2017|
|Period||16/01/17 → 20/01/17|
Bibliographical noteFunding Information:
K. Subramani—Supported by the National Science Foundation through Award CCF-1305054 and also supported by the Air Force of Scientific Research through Award FA9550-12-1-0199.
V. Mkrtchyan—This research has been supported in part by the Air Force of Scientific Research through Award FA9550-12-1-0199.
© Springer International Publishing AG 2017.
ASJC Scopus subject areas
- Theoretical Computer Science
- Computer Science (all)