Searching for "Greedy Algorithms for the Shortest Common Superstring That Are Asymptotically Optimal." – sorted by Relevance.

Order by: Citations | Year (Descending) | Year (Ascending) | Recency

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB

2 documents found, showing 1 through 2.

Greedy Algorithms For The Shortest Common Superstring That Are Asymptotically Optimal
by April Alan Frieze, Wojciech Szpankowski — 1996
…GREEDY ALGORITHMS FOR THE SHORTEST COMMON SUPERSTRING THAT ARE ASYMPTOTICALLY OPTIMAL April 4…
Cited by 5 (4 self) – Add To MetaCart

Greedy approximation Algorithm For constructing Shortest Common Superstring
by Jorma Tarhio and Esko Ukkonen, Wojciech Szpankowski — 1988
…GREEDY ALGORITHMS FOR THE SHORTEST COMMON SUPERSTRING THAT ARE ASYMPTOTICALLY OPTIMAL June 17…
Cited by 25 (0 self) – Add To MetaCart

Showing 1 through 2.

Try your query at: Scholar | Yahoo! | Ask | Bing | CSB