Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

27

WAOA
2007
Springer

favoriteEmaildiscussreport

109views Algorithms» more WAOA 2007»

The Minimum Substring Cover Problem

14 years 5 months ago

The Minimum Substring Cover Problem

Download www.eng.tau.ac.il

Danny Hermelin, Dror Rawitz, Romeo Rizzi, St&eacut

Real-time Traffic

Algorithms | WAOA 2007 |

claim paper

Related Content

» The approximability of the String Barcoding problem

» The Greedy Algorithm for the Minimum Common String Partition Problem

» Complexity of Approximating Closest Substring Problems

» Improved approximation algorithms for minimum ANDcircuits problem via kset cover

» Polynomial time approximation schemes for minimum disk cover problems

» Computation of Substring Probabilities in Stochastic Grammars

» The MinimumEntropy Set Cover Problem

» Crown reductions for the Minimum Weighted Vertex Cover problem

» An Approximation Algorithm for the Minimum Latency Set Cover Problem

Post Info
More Details (n/a)

Added	09 Jun 2010
Updated	09 Jun 2010
Type	Conference
Year	2007
Where	WAOA
Authors	Danny Hermelin, Dror Rawitz, Romeo Rizzi, Stéphane Vialette

Comments (0)