论文信息 - A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs

A 0.821-Ratio Purely Combinatorial Algorithm for Maximum k-vertex Cover in Bipartite Graphs

We study the polynomial time approximation of the max k-vertex cover problem in bipartite graphs and propose a purely combinatorial algorithm that beats the only such known algorithm, namely the greedy approach. We present a computer-assisted analysis of our algorithm, establishing that the worst case approximation guarantee is bounded below by 0.821.

Vangelis Th. Paschos | Bruno Escoffier | Édouard Bonnet | Georgios Stamoulis

[1] Ojas Parekh,et al. On Partial Vertex Cover and Budgeted Maximum Coverage Problems in Bipartite Graphs , 2014, IFIP TCS.

[2] Hooyeon Lee,et al. Approximating low-dimensional coverage problems , 2011, SoCG '12.

[3] Maxim Sviridenko,et al. Approximation Algorithms for Maximum Coverage and Max Cut with Given Sizes of Parts , 1999, IPCO.

[4] Philip Wolfe,et al. An algorithm for quadratic programming , 1956 .

[5] Marek Karpinski,et al. Improved approximation of Max-Cut on graphs of bounded degree , 2002, J. Algorithms.

[6] Erez Petrank. The hardness of approximation: Gap location , 2005, computational complexity.

[7] Michael Langberg,et al. Approximation Algorithms for Maximization Problems Arising in Graph Partitioning , 2001, J. Algorithms.

[8] Bruno Simeone,et al. The maximum vertex coverage problem on bipartite graphs , 2014, Discret. Appl. Math..

[9] Jiawei Zhang,et al. On approximation of max-vertex-cover , 2002, Eur. J. Oper. Res..

[10] Paolo Nobili,et al. Improved approximation of maximum vertex cover , 2006, Oper. Res. Lett..

[11] D. Hochbaum,et al. Analysis of the greedy approach in problems of maximum k‐coverage , 1998 .