On approximating four covering and packing problems

In this paper, we consider approximability issues of the following four problems: triangle packing, full sibling reconstruction, maximum profit coverage and 2-coverage. All of them are generalized or specialized versions of set-cover and have applications in biology ranging from full-sibling reconstructions in wild populations to biomolecular clusterings; however, as this paper shows, their approximability properties differ considerably. Our inapproximability constant for the triangle packing problem improves upon the previous results in [A. Caprara, R. Rizzi, Packing triangles in bounded degree graphs, Inform. Process. Lett. 84 (4) (2002) 175-180; J. Chlebikova, M. Chlebik, Complexity of approximating bounded variants of optimization problems, Theoret. Comput. Sci. 354 (3) (2006) 320-338]; this is done by directly transforming the inapproximability gap of Hastad for the problem of maximizing the number of satisfied equations for a set of equations over GF(2) [J. Hastad, Some optimal inapproximability results, in: Proc. of the 29th Annual ACM Symp. on Theory of Computing, 1997, pp. 1-10] and is interesting in its own right. Our approximability results on the full siblings reconstruction problems answers questions originally posed by Berger-Wolf et al. [T.Y. Berger-Wolf, B. DasGupta, W. Chaovalitwongse, M.V. Ashley, Combinatorial reconstruction of sibling relationships, in: Proc. of the 6th International Symposium on Computational Biology and Genome Informatics, 2005, pp. 1252-1255; T.Y. Berger-Wolf, S. Sheikh, B. DasGupta, M.V. Ashley, I. Caballero, W. Chaovalitwongse, S.L. Putrevu, Reconstructing sibling relationships in wild populations, Bioinformatics 23 (13) (2007) i49-i56] and our results on the maximum profit coverage problem provides almost matching upper and lower bounds on the approximation ratio, answering a question posed by Hassin and Or [R. Hassin, E. Or, A maximum profit coverage algorithm with application to small molecules cluster identification, in: 5th International Workshop Experimental Algorithms, in: Lecture Notes in Comput. Sci., vol. 4007, Springer-Verlag, 2006, pp. 265-276].

[1]  Bhaskar DasGupta,et al.  Error tolerant sibship reconstruction in wild populations. , 2008, Computational systems bioinformatics. Computational Systems Bioinformatics Conference.

[2]  Vineet Bafna,et al.  Genome Rearrangements and Sorting by Reversals , 1996, SIAM J. Comput..

[3]  W. Art Chaovalitwongse,et al.  Reconstructing sibling relationships in wild populations , 2007, ISMB/ECCB.

[4]  C. Field,et al.  Estimation of Single-Generation Sibling Relationships Based on DNA Markers , 1999 .

[5]  Oded Schwartz,et al.  On the complexity of approximating k-set packing , 2006, computational complexity.

[6]  Michael S. Blouin,et al.  DNA-based methods for pedigree reconstruction and kinship analysis in natural populations , 2003 .

[7]  Alexander Schrijver,et al.  On the Size of Systems of Sets Every t of Which Have an SDR, with an Application to the Worst-Case Ratio of Heuristics for Packing Problems , 1989, SIAM J. Discret. Math..

[8]  Vijay V. Vazirani,et al.  Approximation Algorithms , 2001, Springer Berlin Heidelberg.

[9]  Tanya Y. Berger-Wolf,et al.  Combinatorial Reconstruction of Sibling Relationships , 2005 .

[10]  W. Art Chaovalitwongse,et al.  Set covering approach for reconstruction of sibling relationships , 2007, Optim. Methods Softw..

[11]  Max Planck,et al.  Complexity of approximating bounded variants of optimization problems , 2008 .

[12]  Subhash Khot,et al.  Ruling out PTAS for graph min-bisection, densest subgraph and bipartite clique , 2004, 45th Annual IEEE Symposium on Foundations of Computer Science.

[13]  Piotr Berman,et al.  Optimizing misdirection , 2003, SODA '03.

[14]  Hans Jürgen Schneider,et al.  Proceedings of the International Workshop on Graph-Theoretic Concepts in Computer Science , 1987 .

[15]  ChlebíkMiroslav,et al.  Complexity of approximating bounded variants of optimization problems , 2006 .

[16]  Jinliang Wang,et al.  Sibship reconstruction from genetic data with typing errors. , 2004, Genetics.

[17]  B. Smith,et al.  Accurate partition of individuals into full-sib families from genetic data without parental information. , 2001, Genetics.

[18]  Anthony Almudevar,et al.  A simulated annealing algorithm for maximum likelihood pedigree reconstruction. , 2003, Theoretical population biology.

[19]  Miroslav Chlebík,et al.  Complexity of approximating bounded variants of optimization problems , 2006, Theor. Comput. Sci..

[20]  Bin Ma,et al.  Optimizing Multiple Spaced Seeds for Homology Search , 2004, CPM.

[21]  A. Jones,et al.  Methods of parentage analysis in natural populations , 2003, Molecular ecology.

[22]  Uriel Feige,et al.  Zero Knowledge and the Chromatic Number , 1998, J. Comput. Syst. Sci..

[23]  Miroslav Chlebík,et al.  Approximation Hardness for Small Occurrence Instances of NP-Hard Problems , 2003, CIAC.

[24]  Viggo Kann,et al.  Maximum Bounded 3-Dimensional Matching is MAX SNP-Complete , 1991, Inf. Process. Lett..

[25]  C. Pandu Rangan,et al.  The Vertex-Disjoint Triangles Problem , 1998, WG.

[26]  C. Field,et al.  Accuracy, efficiency and robustness of four algorithms allowing full sibship reconstruction from DNA marker data , 2004, Molecular ecology.

[27]  R L Hammond,et al.  Mating frequency and mating system of the polygynous ant, Leptothorax acervorum , 2001, Molecular ecology.

[28]  Noga Alon,et al.  Derandomized graph products , 1995, computational complexity.

[29]  Vineet Bafna,et al.  Genome rearrangements and sorting by reversals , 1993, Proceedings of 1993 IEEE 34th Annual Foundations of Computer Science.

[30]  Refael Hassin,et al.  A Maximum Profit Coverage Algorithm with Application to Small Molecules Cluster Identification , 2006, WEA.

[31]  Johan Håstad,et al.  Some optimal inapproximability results , 2001, JACM.

[32]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[33]  Piotr Berman,et al.  On the Complexity of Approximating the Independent Set Problem , 1989, Inf. Comput..

[34]  W. G. Hill,et al.  Sibship reconstruction in hierarchical population structures using Markov chain Monte Carlo techniques. , 2002, Genetical research.

[35]  B Dasgupta,et al.  KINALYZER, a computer program for reconstructing sibling groups , 2009, Molecular ecology resources.

[36]  B. May,et al.  A graph‐theoretic approach to the partition of individuals into full‐sib families , 2003, Molecular ecology.

[37]  P. Berman,et al.  On Some Tighter Inapproximability Results , 1998, Electron. Colloquium Comput. Complex..

[38]  Dmitry A. Konovalov,et al.  kingroup: a program for pedigree relationship reconstruction and kin group assignments using genetic markers , 2004 .

[39]  Alberto Caprara,et al.  Packing triangles in bounded degree graphs , 2002, Inf. Process. Lett..

[40]  Ian Painter,et al.  Sibship Reconstruction without Parental Information , 1997 .

[41]  Marek Karpinski,et al.  Improved Approximation Lower Bounds on Small Occurrence Optimization , 2003, Electron. Colloquium Comput. Complex..

[42]  Ashfaq Khokhar,et al.  Consensus methods for reconstruction of sibling relationships from genetic data , 2008, AAAI 2008.

[43]  Subhash Khot.  Ruling Out PTAS for Graph Min-Bisection, Densest Subgraph and Bipartite Clique , 2004, FOCS.

[44]  Piotr Berman,et al.  A d/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs , 2000, Nord. J. Comput..

[45]  Marek Karpinski,et al.  On Some Tighter Inapproximability Results (Extended Abstract) , 1999, ICALP.

[46]  Uriel Feige,et al.  The Dense k -Subgraph Problem , 2001, Algorithmica.