Convex recolorings of strings and trees: Definitions, hardness results and algorithms.

Shlomo Moran Sagi Snir

Published in: J. Comput. Syst. Sci. (2008)

Keyphrases

computational complexity
orders of magnitude
optimization problems
computationally efficient
data sets
learning algorithm
significant improvement
np hard
worst case
theoretical analysis
index structure
times faster
convex optimization