Meesum, Syed M. ; Panolan, Fahad ; Saurabh, Saket ; Zehavi, Meirav (2019) Rank Vertex Cover as a Natural Problem for Algebraic Compression SIAM Journal on Discrete Mathematics, 33 (3). pp. 1277-1296. ISSN 0895-4801
Full text not available from this repository.
Official URL: http://doi.org/10.1137/17M1154370
Related URL: http://dx.doi.org/10.1137/17M1154370
Abstract
The question of the existence of a polynomial kernelization of the Vertex Cover Above LP problem has been a longstanding, notorious open problem in Parameterized Complexity. Five years ago, the breakthrough work by Kratsch and Wahlstrom on representative sets has finally answered this question in the affirmative [FOCS 2012]. In this paper, we present an alternative, algebraic compression of the Vertex Cover Above LP problem into the Rank Vertex Cover problem. Here, the input consists of a graph G, a parameter k, and a bijection between V (G) and the set of columns of a representation of a matriod M, and the objective is to find a vertex cover whose rank is upper bounded by k.
| Item Type: | Article |
|---|---|
| Source: | Copyright of this article belongs to Society for Industrial and Applied Mathematics. |
| ID Code: | 123368 |
| Deposited On: | 14 Sep 2021 12:08 |
| Last Modified: | 14 Sep 2021 12:08 |
Repository Staff Only: item control page
