Pages that link to "Item:Q1038476"

The following pages link to Why greed works for shortest common superstring problem (Q1038476):

Displaying 3 items.

• A probabilistic PTAS for shortest common superstring (Q393897) (← links)
• On the greedy algorithm for the shortest common superstring problem with reversals (Q903196) (← links)
• Relationship between superstring and compression measures: new insights on the greedy conjecture (Q1752482) (← links)