Solving SCS for bounded length strings in fewer than 2n steps

It is still not known whether a shortest common superstring (SCS) of n input strings can be found faster than in O⁎(2n) time (O⁎(⋅) suppresses polynomial factors of the input length). In this short note, we show that for any constant r, SCS for strings of length at most r can be solved in time O⁎(2(...

Ausführliche Beschreibung

Bibliographische Detailangaben

Veröffentlicht in:	Information processing letters Jg. 114; H. 8; S. 421 - 425
Hauptverfasser:	Golovnev, Alexander, Kulikov, Alexander S., Mihajlin, Ivan
Format:	Journal Article
Sprache:	Englisch
Veröffentlicht:	Elsevier B.V 01.08.2014
Schlagworte:	Algorithms Exact algorithm Exponential-time algorithm NP-hard problem Shortest common superstring Traveling salesman problem Exponential-time algorithm Traveling salesman problem Algorithms Shortest common superstring NP-hard problem Exact algorithm
ISSN:	0020-0190, 1872-6119
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!