Parameterized Complexity and Approximation Algorithms

By Daniel Marx. Computer/law journal, 2008

314 citations recorded by the source corpus.

Subfields: Computational Theory and Mathematics, Computer Networks and Communications

View Paper: https://www.semanticscholar.org/paper/f8ccf92a960893a07c58ec44ec63046029b6cc9a

How researchers see this paper

The researchers whose trusted networks rank it highest, strongest advocate first. Every researcher gets a different order.

In Computational Theory and Mathematics

1. Jiong Guo
2. Rolf Niedermeier
3. Dexter Campbell Kozen
4. Dimitrios M. Thilikos

In Computer Networks and Communications

1. Jiong Guo
2. Rolf Niedermeier
3. Dimitrios M. Thilikos

Citations in the corpus

• Invitation to data reduction and problem kernelization (2007, result): “Is there even some analogue to the PCP theory for non-approximability results that allows to show non-kernelizability results? We only mention in passing that there is also a broader view on the general relationship between parameterized complexity and approximation algorithms; we recommend the rece”