Sciweavers

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

84

CPM
2009
Springer

122views Combinatorics» more CPM 2009»

Reoptimization of the Shortest Common Superstring Problem

15 years 9 months ago

Reoptimization of the Shortest Common Superstring Problem

Download www.ita.inf.ethz.ch

Davide Bilò, Hans-Joachim Böckenhauer,

Real-time Traffic

CPM 2009 | Discrete Geometry |

claim paper

Related Content

» Algorithms for Three Versions of the Shortest Common Superstring Problem

» Conditional Inequalities and the Shortest Common Superstring Problem

» String Noninclusion Optimization Problems

Post Info
More Details (n/a)

Added	26 May 2010
Updated	26 May 2010
Type	Conference
Year	2009
Where	CPM
Authors	Davide Bilò, Hans-Joachim Böckenhauer, Dennis Komm, Richard Královic, Tobias Mömke, Sebastian Seibert, Anna Zych

Comments (0)