Searching for "A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem." – 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.

A 2 2/3-Approximation Algorithm for the Shortest Superstring Problem
by Chris Armen, Clifford Stein — 1996 — In Proc. 7th Symp. on Combinatorial Pattern Matching, Lecture Notes in Computer Science
…A 2 2 3 --Approximation Algorithm for the Shortest Superstring Problem Chris Armen University…
Cited by 12 (0 self) – Add To MetaCart

A 2 2/3 Superstring Approximation Algorithm
by Chris Armen, Clifford Stein — 1998
…A 2 2 3 Superstring Approximation Algorithm Chris Armen University of Hartford W. Hartford, CT…
Add To MetaCart

Showing 1 through 2.

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