Analysis of heuristics.

MaRDI QIDQ3585142zbMATH OpenFDO

Authors Maik Weinard

Publication date 19 August 2010

Full work available at URL http://publikationen.ub.uni-frankfurt.de/volltexte/2006/2423/

zbMATH Keywords

approximationcharacter stringgreedy algorithmheuristicsservice strategyshortest common superstring problem

Mathematics Subject Classification ID

Research exposition (monographs, survey articles) pertaining to computer science (68-02) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Problem solving in the context of artificial intelligence (heuristics, search strategies, etc.) (68T20) Algorithms on strings (68W32) Research exposition (monographs, survey articles) pertaining to operations research and mathematical programming (90-02) Approximation methods and heuristics in mathematical programming (90C59) Mathematical programming (90C99)

Recommendations

• CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM
• FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science
• On the Greedy Superstring Conjecture
• Linear approximation of shortest superstrings
• Intractability and analysis of heuristics for discrete optimization. II

Cited in

(1)

• The mathematical modeling of heuristics.

This page was built for publication: Analysis of heuristics.

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3585142)