09511 Open Problems – Parameterized complexity and approximation algorithms

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



PDF
Thumbnail PDF

File

DagSemProc.09511.3.pdf
  • Filesize: 184 kB
  • 10 pages

Document Identifiers

Author Details

Erik D. Demaine
MohammadTaghi Hajiaghayi
Dániel Marx

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

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.

Subject Classification

Keywords
  • Parameterized complexity
  • approximation algorithms
  • open problems

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail