License
When quoting this document, please refer to the following
URN: urn:nbn:de:0030-drops-24992
URL: http://drops.dagstuhl.de/opus/volltexte/2010/2499/
Go to the corresponding Portal


Demaine, Erik D. ; Hajiaghayi, MohammadTaghi ; Marx, Dániel

09511 Open Problems -- Parameterized complexity and approximation algorithms

pdf-format:
Document 1.pdf (184 KB)


Abstract

The paper contains a list of the problems presented on Monday, December 14, 2009 at the open problem session of the Seminar on Parameterized Complexity and Approximation Algorithms, held at Schloss Dagstuhl in Wadern, Germany.

BibTeX - Entry

@InProceedings{demaine_et_al:DSP:2010:2499,
  author =	{Erik D. Demaine and MohammadTaghi Hajiaghayi and D{\'a}niel Marx},
  title =	{09511 Open Problems -- Parameterized complexity and approximation algorithms},
  booktitle =	{Parameterized complexity and approximation algorithms},
  year =	{2010},
  editor =	{Erik D. Demaine and MohammadTaghi Hajiaghayi and D{\'a}niel Marx},
  number =	{09511},
  series =	{Dagstuhl Seminar Proceedings},
  ISSN =	{1862-4405},
  publisher =	{Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, Germany},
  address =	{Dagstuhl, Germany},
  URL =		{http://drops.dagstuhl.de/opus/volltexte/2010/2499},
  annote =	{Keywords: Parameterized complexity, approximation algorithms, open problems}
}

Keywords: Parameterized complexity, approximation algorithms, open problems
Seminar: 09511 - Parameterized complexity and approximation algorithms
Issue Date: 2010
Date of publication: 02.03.2010


DROPS-Home | Fulltext Search | Imprint Published by LZI