The Buss Reduction for the k-Weighted Vertex Cover Problem

The k-vertex cover (k-VC) problem is to find a VC of cardinality no more than k on a given undirected graph, and the k-weighted VC (k-WVC) problem is to find a VC of a weight no more than k on a given vertex-weighted undirected graph. In this paper, we generalize the Buss reduction, an important kernelization technique for the k-VC problem, to the kWVC problem. We study its properties for the k-VC problem and the k-WVC problem on surrogates of large real-world graphs that are generated using the Erdős-Rényi model and the Barabási-Albert model. We also argue that our study of the Buss reduction bears important implications on the kernelization of combinatorial problems that have been shown to be reducible to WVC problems.

[1]  Eric Filiol,et al.  Combinatorial Optimisation of Worm Propagation on an Unknown Network , 2007 .

[2]  Kristina Lerman,et al.  The "Majority Illusion" in Social Networks , 2015, PloS one.

[3]  Kristina Lerman,et al.  Neighbor-Neighbor Correlations Explain Measurement Bias in Networks , 2017, Scientific Reports.

[4]  Dimitrios M. Thilikos,et al.  Kernels for the Vertex Cover Problem on the Preferred Attachment Model , 2006, WEA.

[5]  Michael R. Fellows,et al.  Crown Structures for Vertex Cover Kernelization , 2007, Theory of Computing Systems.

[6]  T. K. Satish Kumar.  Kernelization, Generation of Bounds, and the Scope of Incremental Computation for Weighted Constraint Satisfaction Problems , 2016, ISAIM.

[7]  Leslie E. Trotter,et al.  Vertex packings: Structural properties and algorithms , 1975, Math. Program..

[8]  A. Horvath.  The software package dependency networks of some Linux distributions , 2012, 2012 IEEE 4th International Conference on Nonlinear Science and Complexity (NSC).

[9]  Judy Goldsmith,et al.  Nondeterminism Within P , 1993, SIAM J. Comput..

[10]  Albert-Lszl Barabsi,et al.  Network Science , 2016, Encyclopedia of Big Data.

[11]  Albert,et al.  Emergence of scaling in random networks , 1999, Science.

[12]  Hanif D. Sherali,et al.  An Air Force Crew Allocation and Scheduling Problem , 1984 .

[13]  Hong Xu,et al.  The Nemhauser-Trotter Reduction and Lifted Message Passing for the Weighted CSP , 2017, CPAIOR.

[14]  Richard M. Karp,et al.  Reducibility Among Combinatorial Problems , 1972, 50 Years of Integer Programming.

[15]  Alan M. Frieze,et al.  Random graphs , 2006, SODA '06.

[16]  Jens Vygen,et al.  The Book Review Column1 , 2020, SIGACT News.

[17]  T. K. Satish Kumar,et al.  A Framework for Hybrid Tractability Results in Boolean Weighted Constraint Satisfaction Problems , 2008, CP.

[18]  T. K. Satish Kumar.  Lifting Techniques for Weighted Constraint Satisfaction Problems , 2008, ISAIM.

[19]  Michael R. Fellows,et al.  Kernelization Algorithms for the Vertex Cover Problem: Theory and Experiments , 2004, ALENEX/ANALC.

[20]  Ulrik Brandes,et al.  What is network science? , 2013, Network Science.