Covering Analysis of the Greedy Algorithm for Partial Cover
Authors:
- 1 January 2010
- book chapter
- Published by Springer Nature in Lecture Notes in Computer Science
- p. 102-113
Abstract
No abstract availableKeywords
This publication has 26 references indexed in Scilit:
- Planning optimal measurements of isotopomer distributions for estimation of metabolic fluxesBioinformatics, 2006
- Optimization of cDNA-AFLP experiments using genomic sequence dataBioinformatics, 2005
- Towards a DNA sequencing theory (learning a string)2002
- Improved performance of the greedy algorithm for partial coverInformation Processing Letters, 1997
- Discovering unbounded unions of regular pattern languages from positive examples1996
- Learning hierarchical rule sets1992
- A Greedy Heuristic for the Set-Covering ProblemMathematics of Operations Research, 1979
- On the ratio of optimal integral and fractional coversDiscrete Mathematics, 1975
- Approximation algorithms for combinatorial problemsJournal of Computer and System Sciences, 1974
- Reducibility among Combinatorial Problems1972