Pages that link to "Item:Q1386458"
From MaRDI portal
The following pages link to Greedy algorithms for the shortest common superstring that are asymptotically optimal (Q1386458):
Displayed 5 items.
- A probabilistic PTAS for shortest common superstring (Q393897) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)
- Why Greed Works for Shortest Common Superstring Problem (Q3506957) (← links)