Open problems around exact algorithms

Research output: Contribution to journalArticleAcademicpeer-review

43 Citations (Scopus)

Abstract

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.
Original languageEnglish
Pages (from-to)397-405
JournalDiscrete Applied Mathematics
Volume156
Issue number3
DOIs
Publication statusPublished - 2008

Fingerprint Dive into the research topics of 'Open problems around exact algorithms'. Together they form a unique fingerprint.

Cite this