"A Greedy Algorithm for the Shortest Common Superstring is Asymptotical" by Alan Frieze and Wojciech Szpankowski

Menu

Skip to main content

Department of Computer Science Technical Reports

A Greedy Algorithm for the Shortest Common Superstring is Asymptotically Optimal

Alan Frieze
Wojciech Szpankowski, Purdue UniversityFollow

Date of this Version

1995

Tech Report Number

95-052

Number of Pages

11

Included in

Computer Sciences Commons

COinS