09511 Open Problems – Parameterized complexity and approximation algorithms

2010/01/01 by Demaine, Erik D., Hajiaghayi, MohammadTaghi, Marx, Dániel
Computer Science · Mathematics · #Advanced Graph Theory Research #Algorithm #Approximation algorithm #Computational complexity theory #Computer science #Mathematics #Parameterized complexity #Session (web analytics) #Theoretical computer science #World Wide Web #approximation algorithms #open problems

paper · doi:10.4230/dagsemproc.09511.3

published in DROPS (Schloss Dagstuhl – Leibniz Center for Informatics), 0 (Schloss Dagstuhl – Leibniz Center for Informatics)

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 Algorithms
• 09391 Abstracts Collection – Algorithms and Complexity for Continuous Problems
• Parameterized Complexity and Approximation Algorithms
• 06391 Abstracts Collection – Algorithms and Complexity for Continuous Problems