Open problems around exact algorithms

We list a number of open questions around worst case time bounds and worst case space bounds for NP-hard problems. We are interested in exponential time solutions for these problems with a relatively good worst case behavior. We summarize what is known on these problems, we discuss related results,...

Ausführliche Beschreibung

Gespeichert in:

Bibliographische Detailangaben
Veröffentlicht in:	Discrete Applied Mathematics Jg. 156; H. 3; S. 397 - 405
1. Verfasser:	Woeginger, Gerhard J.
Format:	Journal Article Tagungsbericht
Sprache:	Englisch
Veröffentlicht:	Lausanne Elsevier B.V 01.02.2008 Amsterdam Elsevier New York, NY
Schlagworte:	Algorithmics. Computability. Computer arithmetics Applied sciences Combinatorial optimization Combinatorics Combinatorics. Ordered structures Computational complexity Computer science; control theory; systems Exact sciences and technology Mathematics Sciences and techniques of general use Theoretical computing Combinatorial optimization Computational complexity Computer theory NP hard problem Pointer Behavior Combinatorics Algorithm
ISSN:	0166-218X, 1872-6771
Online-Zugang:	Volltext
Tags:	Tag hinzufügen Keine Tags, Fügen Sie den ersten Tag hinzu!

Schreiben Sie den ersten Kommentar!