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


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

09511 Abstracts Collection -- Parameterized complexity and approximation algorithms

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


Abstract

From 14. 12. 2009 to 17. 12. 2009., the Dagstuhl Seminar 09511 ``Parameterized complexity and approximation algorithms '' was held in Schloss Dagstuhl~--~Leibniz Center for Informatics. During the seminar, several participants presented their current research, and ongoing work and open problems were discussed. Abstracts of the presentations given during the seminar as well as abstracts of seminar results and ideas are put together in this paper. The first section describes the seminar topics and goals in general. Links to extended abstracts or full papers are provided, if available.

BibTeX - Entry

@InProceedings{demaine_et_al:DSP:2010:2502,
  author =	{Erik D. Demaine and MohammadTaghi Hajiaghayi and D{\'a}niel Marx},
  title =	{09511 Abstracts Collection -- 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/2502},
  annote =	{Keywords: Parameterized complexity, Approximation algorithms}
}

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


DROPS-Home | Fulltext Search | Imprint Published by LZI