Greedy algorithms for the shortest common superstring that are asymptotically optimal

DOI10.1007/PL00009207zbMath0896.68067WikidataQ57401553 ScholiaQ57401553MaRDI QIDQ1386458

Wojciech Szpankowski, Alan M. Frieze

Publication date: 24 May 1998

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

shortest common superstring

Mathematics Subject Classification ID

Parallel algorithms in computer science (68W10)

Related Items (5)

A Probabilistic PTAS for Shortest Common Superstring ⋮ A probabilistic PTAS for shortest common superstring ⋮ Why Greed Works for Shortest Common Superstring Problem ⋮ Why greed works for shortest common superstring problem ⋮ A greedy randomized adaptive search procedure with path relinking for the shortest superstring problem

This page was built for publication: Greedy algorithms for the shortest common superstring that are asymptotically optimal