Pages that link to "Item:Q4943853"
From MaRDI portal
The following pages link to \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853):
Displayed 20 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)
- A \(2_3^2\) superstring approximation algorithm (Q1281759) (← links)
- A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem (Q2344005) (← links)
- A survey on combinatorial optimization in dynamic environments (Q2907959) (← links)
- On the Readability of Overlap Digraphs (Q2942251) (← links)
- On the Shortest Common Superstring of NGS Reads (Q2988815) (← links)
- Restricted Common Superstring and Restricted Common Supersequence (Q3011876) (← links)
- A Probabilistic PTAS for Shortest Common Superstring (Q3182960) (← links)
- Why Greed Works for Shortest Common Superstring Problem (Q3506957) (← links)
- Minimum-Weight Cycle Covers and Their Approximability (Q3508566) (← links)
- Reoptimization of the Shortest Common Superstring Problem (Q3637106) (← links)
- Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
- (Q4997780) (← links)
- CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM (Q5714670) (← links)