Pages that link to "Item:Q4595487"
From MaRDI portal
The following pages link to Greedy algorithms for the shortest common superstring that are asymtotically optimal (Q4595487):
Displaying 12 items.
- A probabilistic PTAS for shortest common superstring (Q393897) (← links)
- On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← links)
- Approximating shortest superstrings with constraints (Q1341729) (← links)
- Greedy algorithms for the shortest common superstring that are asymptotically optimal (Q1386458) (← links)
- Approximation algorithms for the shortest common superstring problem (Q1822981) (← links)
- All instantiations of the greedy algorithm for the shortest common superstring problem are equivalent (Q2146125) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- Greedy Conjecture for Strings of Length 4 (Q2942268) (← links)
- Algorithms for Three Versions of the Shortest Common Superstring Problem (Q3575256) (← links)
- Linear approximation of shortest superstrings (Q4310837) (← links)
- Approximating shortest superstrings with constraints (Q5060130) (← links)