New Approximation Algorithms for Minimum Weighted Edge Cover

We describe two new 3/2-approximation algorithms and a new 2-approximation algorithm for the minimum weight edge cover problem in graphs. We show that one of the 3/2-approximation algorithms, the Dual Cover algorithm, computes the lowest weight edge cover relative to previously known algorithms as well as the new algorithms reported here. The Dual Cover algorithm can also be implemented to be faster than the other 3/2-approximation algorithms on serial computers. Many of these algorithms can be extended to solve the b-Edge Cover problem as well. We show the relation of these algorithms to the K-Nearest Neighbor graph construction in semi-supervised learning and other applications.

[1]  Richard P. Anstee.  A Polynomial Algorithm for b-Matchings: An Alternative Approach , 1987, Inf. Process. Lett..

[2]  Vasek Chvátal,et al.  A Greedy Heuristic for the Set-Covering Problem , 1979, Math. Oper. Res..

[3]  Antonino Tumeo,et al.  Adaptive Anonymization of Data using b-Edge Cover , 2018, SC18: International Conference for High Performance Computing, Networking, Storage and Analysis.

[4]  Dorit S. Hochbaum,et al.  Approximation Algorithms for the Set Covering and Vertex Cover Problems , 1982, SIAM J. Comput..

[5]  Alexander Schrijver,et al.  Combinatorial optimization. Polyhedra and efficiency. , 2003 .

[6]  Approximating Minimum-Power Network Design Problems , 2007 .

[7]  Brian W. Barrett,et al.  Introducing the Graph 500 , 2010 .

[8]  Sebastiano Vigna,et al.  The webgraph framework I: compression techniques , 2004, WWW '04.

[9]  S. M. Ferdous,et al.  Parallel Algorithms Through Approximation: B-Edge Cover , 2018, 2018 IEEE International Parallel and Distributed Processing Symposium (IPDPS).

[10]  David S. Johnson,et al.  Approximation algorithms for combinatorial problems , 1973, STOC.

[11]  Sebastiano Vigna,et al.  BUbiNG: massive crawling for the masses , 2014, WWW.

[12]  Seth Pettie,et al.  Approximate Generalized Matching: $f$-Factors and $f$-Edge Covers , 2017, ArXiv.

[13]  Partha Pratim Talukdar,et al.  Graph-Based Semi-Supervised Learning , 2014, Graph-Based Semi-Supervised Learning.

[14]  Alex Pothen,et al.  A New 3/2-Approximation Algorithm for the b-Edge Cover Problem , 2016, CSC.

[15]  Shih-Fu Chang,et al.  Graph construction and b-matching for semi-supervised learning , 2009, ICML '09.

[17]  Ronald Rosenfeld,et al.  Semi-supervised learning with graphs , 2005 .

[18]  Marshall L. Fisher,et al.  The Lagrangian Relaxation Method for Solving Integer Programming Problems , 2004, Manag. Sci..

[19]  Florin Dobrian,et al.  A 2/3-Approximation Algorithm for Vertex-weighted Matching , 2019, Discret. Appl. Math..

[20]  Yuji Matsumoto,et al.  Using the Mutual k-Nearest Neighbor Graphs for Semi-supervised Classification on Natural Language Data , 2011, CoNLL.

[21]  Michel Minoux,et al.  Accelerated greedy algorithms for maximizing submodular set functions , 1978 .

[22]  Harold N. Gabow,et al.  Data structures for weighted matching and nearest common ancestors with linking , 1990, SODA '90.