LATIN 2004: Theoretical Informatics

DOI10.1007/b95852zbMath1196.68100OpenAlexW2475444492MaRDI QIDQ5901658

Stephan J. Eidenbenz, Mark Cieliebak

Publication date: 7 May 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/b95852

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Protein sequences, DNA sequences (92D20) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (8)

Approximation schemes for subset-sums ratio problems ⋮ Approximating subset sum ratio via subset sum computations ⋮ The simplified partial digest problem: approximation and a graph-theoretic model ⋮ Faster algorithms for \(k\)-\textsc{Subset Sum} and variations ⋮ A new dynamic programming algorithm for the simplified partial digest problem ⋮ On the approximability of the simplified partial digest problem ⋮ Combinatorial optimization in DNA mapping — a computational thread of the Simplified Partial Digest Problem ⋮ Faster algorithms for \(k\)-subset sum and variations

This page was built for publication: LATIN 2004: Theoretical Informatics