License
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.09511.3
URN: urn:nbn:de:0030-drops-24992
URL: https://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:
09511.SWM.Paper.2499.pdf (0.2 MB)


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:DagSemProc.09511.3,
  author =	{Demaine, Erik D. and Hajiaghayi, MohammadTaghi and Marx, D\'{a}niel},
  title =	{{09511 Open Problems – Parameterized complexity and approximation algorithms}},
  booktitle =	{Parameterized complexity and approximation algorithms},
  pages =	{1--10},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2010},
  volume =	{9511},
  editor =	{Erik D. Demaine and MohammadTaghi Hajiaghayi and D\'{a}niel Marx},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/opus/volltexte/2010/2499},
  URN =		{urn:nbn:de:0030-drops-24992},
  doi =		{10.4230/DagSemProc.09511.3},
  annote =	{Keywords: Parameterized complexity, approximation algorithms, open problems}
}

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


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