论文信息 - The Complexity of the Minimum k-Cover Problem

The Complexity of the Minimum k-Cover Problem

The k-coversproblem (kCP asks us to compute a minimum cardinality set of strings given length k>1 that covers a given string. It was shown in a recent paper, by reduction to 3 -SAT, that the k-covers problem is NP-complete. In this paper we introduce a new problem, that we call the Relaxed Vertex Cover Problem (RVCP), which we show is a special case of Set Cover (SCP). We show further the kCP is equivalent to RVCP restricted to certain classes GXk of graphs that represent all strings x. We discuss approximate solutions of kCP and we state a number of conjectures and open problems related to kCP and GXk.

Richard Cole | Costas S. Iliopoulos | William F. Smyth | Manal Mohamed | Lu Yang

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

[2] Yin Li,et al. Computing the Cover Array in Linear Time , 2001, Algorithmica.

[3] William F. Smyth,et al. An Optimal Algorithm to Compute all the Covers of a String , 1994, Inf. Process. Lett..

[4] William F. Smyth,et al. A Correction to "An Optimal Algorithm to Compute all the Covers of a String" , 1995, Inf. Process. Lett..

[5] Richard Cole,et al. Computing the Minimum k-Cover of a String , 2003, Stringology.

[6] László Lovász,et al. On the ratio of optimal integral and fractional covers , 1975, Discret. Math..

[7] Maxime Crochemore,et al. An Optimal Algorithm for Computing the Repetitions in a Word , 1981, Inf. Process. Lett..

[8] Reuven Bar-Yehuda,et al. A Local-Ratio Theorem for Approximating the Weighted Vertex Cover Problem , 1983, WG.

[9] Costas S. Iliopoulos,et al. Optimal Superprimitivity Testing for Strings , 1991, Inf. Process. Lett..

[10] Stephen A. Cook,et al. The complexity of theorem-proving procedures , 1971, STOC.

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