Pages that link to "Item:Q4943853"
From MaRDI portal
The following pages link to \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853):
Displaying 7 items.
- On the readability of overlap digraphs (Q266924) (← links)
- A probabilistic PTAS for shortest common superstring (Q393897) (← links)
- Restricted and swap common superstring: a multivariate algorithmic perspective (Q494787) (← links)
- Reoptimization of the shortest common superstring problem (Q639296) (← links)
- The greedy algorithm for shortest superstrings (Q834977) (← links)
- Minimum-weight cycle covers and their approximability (Q1028118) (← links)
- Why greed works for shortest common superstring problem (Q1038476) (← links)
