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,...

Full description

Saved in:
Bibliographic Details
Published in:Discrete Applied Mathematics Vol. 156; no. 3; pp. 397 - 405
Main Author: Woeginger, Gerhard J.
Format: Journal Article Conference Proceeding
Language:English
Published: Lausanne Elsevier B.V 01.02.2008
Amsterdam Elsevier
New York, NY
Subjects:
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 Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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, and we provide pointers to the literature.
ISSN:0166-218X
1872-6771
DOI:10.1016/j.dam.2007.03.023