Pages that link to "Item:Q5060130"
From MaRDI portal
The following pages link to Approximating shortest superstrings with constraints (Q5060130):
Displaying 5 items.
- Shortest consistent superstrings computable in polynomial time (Q673640) (← links)
- Approximating shortest superstrings with constraints (Q1341729) (← links)
- Sequential and Parallel Approximation of Shortest Superstrings (Q3128987) (← links)
- Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model (Q3652303) (← links)
- \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853) (← links)