scientific article
zbMath1202.68401MaRDI QIDQ3585142
Publication date: 19 August 2010
Full work available at URL: http://publikationen.ub.uni-frankfurt.de/volltexte/2006/2423/
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
heuristicsapproximationgreedy algorithmshortest common superstring problemservice strategycharacter string
Approximation methods and heuristics in mathematical programming (90C59) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Research exposition (monographs, survey articles) pertaining to computer science (68-02) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical programming (90C99) Algorithms on strings (68W32)
This page was built for publication:
