Greedy algorithms for the shortest common superstring that are asymptotically optimal
From MaRDI portal
Publication:1386458
DOI10.1007/PL00009207zbMath0896.68067WikidataQ57401553 ScholiaQ57401553MaRDI QIDQ1386458
Wojciech Szpankowski, Alan M. Frieze
Publication date: 24 May 1998
Published in: Algorithmica (Search for Journal in Brave)
68W10: Parallel algorithms in computer science
Related Items
A probabilistic PTAS for shortest common superstring, Why greed works for shortest common superstring problem, A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem, A Probabilistic PTAS for Shortest Common Superstring, Why Greed Works for Shortest Common Superstring Problem