08431 Open Problems – Moderately Exponential Time Algorithms

Authors Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan van Rooij, Ryan Williams



PDF
Thumbnail PDF

File

DagSemProc.08431.3.pdf
  • Filesize: 103 kB
  • 8 pages

Document Identifiers

Author Details

Fedor V. Fomin
Kazuo Iwama
Dieter Kratsch
Petteri Kaski
Mikko Koivisto
Lukasz Kowalik
Yoshio Okamoto
Johan van Rooij
Ryan Williams

Cite AsGet BibTex

Fedor V. Fomin, Kazuo Iwama, Dieter Kratsch, Petteri Kaski, Mikko Koivisto, Lukasz Kowalik, Yoshio Okamoto, Johan van Rooij, and Ryan Williams. 08431 Open Problems – Moderately Exponential Time Algorithms. In Moderately Exponential Time Algorithms. Dagstuhl Seminar Proceedings, Volume 8431, pp. 1-8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2008)
https://doi.org/10.4230/DagSemProc.08431.3

Abstract

Two problem sessions were part of the seminar on Moderately Exponential Time Algorithms. Some of the open problems presented at those sessions have been collected.
Keywords
  • Algorithms
  • NP-hard problems
  • Moderately Exponential Time Algorithms

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail