License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08431.3
URN: urn:nbn:de:0030-drops-17986
URL: https://drops.dagstuhl.de/opus/volltexte/2008/1798/
Go to the corresponding Portal


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

08431 Open Problems -- Moderately Exponential Time Algorithms

pdf-format:
08431.SWM.Paper.1798.pdf (0.1 MB)


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.


BibTeX - Entry

@InProceedings{fomin_et_al:DagSemProc.08431.3,
  author =	{Fomin, Fedor V. and Iwama, Kazuo and Kratsch, Dieter and Kaski, Petteri and Koivisto, Mikko and Kowalik, Lukasz and Okamoto, Yoshio and van Rooij, Johan and Williams, Ryan},
  title =	{{08431 Open Problems – Moderately Exponential Time Algorithms}},
  booktitle =	{Moderately Exponential Time Algorithms},
  pages =	{1--8},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2008},
  volume =	{8431},
  editor =	{Fedor V. Fomin and Kazuo Iwama and Dieter Kratsch},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2008/1798},
  URN =		{urn:nbn:de:0030-drops-17986},
  doi =		{10.4230/DagSemProc.08431.3},
  annote =	{Keywords: Algorithms, NP-hard problems, Moderately Exponential Time Algorithms}
}

Keywords: Algorithms, NP-hard problems, Moderately Exponential Time Algorithms
Collection: 08431 - Moderately Exponential Time Algorithms
Issue Date: 2008
Date of publication: 23.12.2008


DROPS-Home | Fulltext Search | Imprint | Privacy Published by LZI