Pages that link to "Item:Q4943853"

The following pages link to \boldmath A $2\frac12$-Approximation Algorithm for Shortest Superstring (Q4943853):

Displaying 30 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)
• A linear-time algorithm for finding approximate shortest common superstrings (Q911299) (← 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)
• Approximating shortest superstrings with constraints (Q1341729) (← links)
• Parameterized complexity of superstring problems (Q1679230) (← links)
• Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)
• Approximation algorithms for the shortest common superstring problem (Q1822981) (← 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)
• Sequential and Parallel Approximation of Shortest Superstrings (Q3128987) (← 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)
• Improved Algorithms for Finding Consistent Superstrings Based on a New Graph Model (Q3652303) (← links)
• Linear approximation of shortest superstrings (Q4310837) (← links)
• Rotations of Periodic Strings and Short Superstrings (Q4360136) (← links)
• Approximating Shortest Superstring Problem Using de Bruijn Graphs (Q4928566) (← links)
• (Q4997780) (← links)
• Improved length bounds for the shortest superstring problem (Q5057460) (← links)
• CONDITIONAL INEQUALITIES AND THE SHORTEST COMMON SUPERSTRING PROBLEM (Q5714670) (← links)