09511 Open Problems – Parameterized complexity and approximation algorithms

2022/01/26 by Demaine, Erik D., Hajiaghayi, MohammadTaghi, Marx, Dániel
#Parameterized complexity #approximation algorithms #open problems

paper · doi: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.

Related

• 09511 Abstracts Collection – Parameterized complexity and approximation algorithms
• A Survey on Approximation in Parameterized Complexity: Hardness and\n Algorithms
• 09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems
• Parameterized Complexity and Approximation Algorithms
• 06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems