On approximating four covering and packing problems
Authors:
- Mary AshleyMAMary Ashley
- Tanya Berger-WolfTBTanya Berger-Wolf
- Piotr BermanPBPiotr Berman
- Wanpracha ChaovalitwongseWCWanpracha Chaovalitwongse
- Bhaskar DasGuptaBDBhaskar DasGupta
- Ming-Yang KaoMKMing-Yang Kao
- 1 August 2009
- journal article
- Published by Elsevier in Journal of Computer and System Sciences
- Vol. 75 (5) , 287-302
Abstract
No abstract availableKeywords
All Related Versions
This publication has 25 references indexed in Scilit:
- Set covering approach for reconstruction of sibling relationshipsOptimization Methods and Software, 2007
- Optimizing Multiple Spaced Seeds for Homology SearchJournal of Computational Biology, 2006
- kingroup: a program for pedigree relationship reconstruction and kin group assignments using genetic markersMolecular Ecology Notes, 2004
- Accuracy, efficiency and robustness of four algorithms allowing full sibship reconstruction from DNA marker dataMolecular Ecology, 2004
- DNA-based methods for pedigree reconstruction and kinship analysis in natural populationsTrends in Ecology & Evolution, 2003
- Mating frequency and mating system of the polygynous ant,Leptothorax acervorumMolecular Ecology, 2001
- The Dense k -Subgraph ProblemAlgorithmica, 2001
- The budgeted maximum coverage problemInformation Processing Letters, 1999
- A threshold of ln n for approximating set coverJournal of the ACM, 1998
- Derandomized graph productscomputational complexity, 1995