Pages that link to "Item:Q3506957"
From MaRDI portal
The following pages link to Why Greed Works for Shortest Common Superstring Problem (Q3506957):
Displaying 4 items.
- Why greed works for shortest common superstring problem (Q1038476) (← 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)
- A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)