Approximation guarantees for shortest superstrings: simpler and better
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 801745 (Why is no real title available?)
- A 2_3² superstring approximation algorithm
- A greedy approximation algorithm for constructing shortest common superstrings
- Algorithms on Strings, Trees and Sequences
- Approximating Shortest Superstrings
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Approximation algorithms for the shortest common superstring problem
- Greedy algorithms for the shortest common superstring that are asymptotically optimal
- Improved approximation guarantees for shortest superstrings using cycle classification by overlap to length ratios
- Improved length bounds for the shortest superstring problem
- Linear approximation of shortest superstrings
- Lyndon words and short superstrings
- Mathematical Foundations of Computer Science 2005
- Rotations of Periodic Strings and Short Superstrings
- Sequential and Parallel Approximation of Shortest Superstrings
- Simpler approximation of the maximum asymmetric traveling salesman problem
- The greedy algorithm for shortest superstrings
- Why greed works for shortest common superstring problem
- \boldmath A 2\frac12-Approximation Algorithm for Shortest Superstring
This page was built for publication: Approximation guarantees for shortest superstrings: simpler and better
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6953190)
