Sciweavers

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

88

CPM
2008
Springer

132views Combinatorics» more CPM 2008»

Constrained LCS: Hardness and Approximation

15 years 4 months ago

Constrained LCS: Hardness and Approximation

Download cs.haifa.ac.il

Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein

Real-time Traffic

Combinatorics | CPM 2008 |

claim paper

Related Content

» Restricted LCS

» LCS Approximation via Embedding into Local Nonrepetitive Strings

» Counter Example for QBucketBrigade Under Prediction Problem

» Restricted Boltzmann Machines are Hard to Approximately Evaluate or Simulate

» Line planning path constrained network flow and inapproximability

» Rate of Convergence for Constrained Stochastic Approximation Algorithms

» Approximate L0 constrained nonnegative matrix and tensor factorization

» Constrained kcenter and movement to independence

» Alternative techniques to solve hard multiobjective optimization problems

Post Info
More Details (n/a)

Added	19 Oct 2010
Updated	19 Oct 2010
Type	Conference
Year	2008
Where	CPM
Authors	Zvi Gotthilf, Danny Hermelin, Moshe Lewenstein

Comments (0)