DagSemProc.09511.1.pdf
- Filesize: 207 kB
- 14 pages
Document
09511 Abstracts Collection – Parameterized complexity and approximation algorithms
Authors
-
Part of:
Volume:
Dagstuhl Seminar Proceedings, Volume 9511
Series: Dagstuhl Seminar Proceedings (DagSemProc) - License:
Creative Commons Attribution 4.0 International license
- Publication Date: 2010-03-02
Cite AsGet BibTex
Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dániel Marx. 09511 Abstracts Collection – Parameterized complexity and approximation algorithms. In Parameterized complexity and approximation algorithms. Dagstuhl Seminar Proceedings, Volume 9511, pp. 1-14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010)
https://doi.org/10.4230/DagSemProc.09511.1
https://doi.org/10.4230/DagSemProc.09511.1
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.
Keywords
- Parameterized complexity
- Approximation algorithms
Metrics
- Access Statistics
-
Total Accesses (updated on a weekly basis)
0PDF Downloads