License: Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.08431.2
URN: urn:nbn:de:0030-drops-17976
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2008/1797/
Go to the corresponding Portal

Fomin, Fedor V. ; Iwama, Kazuo ; Kratsch, Dieter

08431 Executive Summary -- Moderately Exponential Time Algorithms

pdf-format:
08431.SWM.Paper.1797.pdf (0.07 MB)

Abstract

The Dagstuhl seminar on Moderately Exponential Time Algorithms took place
from 19.10.08 to 24.10.08. The 54 participants came from 18 countries.
There were 27 talks and 2 open problem sessions. Talks were complemented
by intensive informal discussions, and many new research directions
and open problems will result from these discussions. The warm and encouraging Dagstuhl atmosphere stimulated new research projects.

BibTeX - Entry

@InProceedings{fomin_et_al:DagSemProc.08431.2,
  author =	{Fomin, Fedor V. and Iwama, Kazuo and Kratsch, Dieter},
  title =	{{08431 Executive Summary – Moderately Exponential Time Algorithms}},
  booktitle =	{Moderately Exponential Time Algorithms},
  pages =	{1--2},
  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/1797},
  URN =		{urn:nbn:de:0030-drops-17976},
  doi =		{10.4230/DagSemProc.08431.2},
  annote =	{Keywords: Algorithms, NP-hard problems, Exact algorithms, Moderately Exponential Time Algorithms}
}

Keywords: Algorithms, NP-hard problems, Exact algorithms, 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