09511 Open Problems – Parameterized complexity and approximation algorithms

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

doi:10.4230/DagSemProc.09511.3

Document

09511 Open Problems – Parameterized complexity and approximation algorithms

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

Part of: Volume: Dagstuhl Seminar Proceedings, Volume 9511
Part of: Series: Dagstuhl Seminar Proceedings (DagSemProc)
License: Creative Commons Attribution 4.0 International license
Publication Date: 2010-03-02

PDF

File

PDF

DagSemProc.09511.3.pdf

Filesize: 184 kB
10 pages

Document Identifiers

DOI: 10.4230/DagSemProc.09511.3
URN: urn:nbn:de:0030-drops-24992

Subject Classification

Keywords

Parameterized complexity
approximation algorithms
open problems

Metrics

Access Statistics
Total Accesses (updated on a weekly basis)

0

PDF Downloads

0

Metadata Views

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.

Cite As Get BibTex

Erik D. Demaine, MohammadTaghi Hajiaghayi, and Dániel Marx. 09511 Open Problems – Parameterized complexity and approximation algorithms. In Parameterized complexity and approximation algorithms. Dagstuhl Seminar Proceedings, Volume 9511, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2010) https://doi.org/10.4230/DagSemProc.09511.3

Author Details

Erik D. Demaine

MohammadTaghi Hajiaghayi

Dániel Marx

Questions / Remarks / Feedback

Feedback for Dagstuhl Publishing

Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail