Back to Results
First PageMeta Content
Superstring theory / Computer science / Mathematics / Computational complexity theory / Approximation algorithm / NP-complete


Algorithms for Three Versions of the Shortest Common Superstring Problem Maxime Crochemore, Marek Cygan, Costas Iliopoulos, Marcin Kubica, Jakub Radoszewski, Wojciech Rytter, Tomasz Walen
Add to Reading List

Document Date: 2010-08-20 17:45:58

Open Document

File Size: 427,11 KB

Share Result on Facebook

City

New York / /

Facility

Tomasz Walen King’s College / University of Warsaw CPM / /

IndustryTerm

approximation algorithm / /

Organization

University of Warsaw CPM / Tomasz Walen King’s College London / /

Person

Costas Iliopoulos / Wojciech Rytter / Marek Cygan / Jakub Radoszewski / /

Product

Shafrir / /

ProvinceOrState

New York / /

Technology

Greedy approximation algorithm / /

SocialTag