SIAM Journal on Computing
Approximation algorithms for NP-complete problems on planar graphs
Journal of the ACM (JACM)
Approximation properties of NP minimization classes
Journal of Computer and System Sciences
On fixed-parameter tractability and approximability of NP optimization problems
Journal of Computer and System Sciences - special issue on complexity theory
On the efficiency of polynomial time approximation schemes
Information Processing Letters
A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem
SIAM Journal on Discrete Mathematics
Vertex cover: further observations and further improvements
Journal of Algorithms
Polynomial-time data reduction for dominating set
Journal of the ACM (JACM)
Strong computational lower bounds via parameterized complexity
Journal of Computer and System Sciences
Polynomial time approximation schemes and parameterized complexity
Discrete Applied Mathematics
The Complexity of Polynomial-Time Approximation
Theory of Computing Systems
Parametric Duality and Kernelization: Lower Bounds and Upper Bounds on Kernel Size
SIAM Journal on Computing
A 4k2 kernel for feedback vertex set
ACM Transactions on Algorithms (TALG)
Approximation algorithms for combinatorial problems
Journal of Computer and System Sciences
A linear kernel for planar feedback vertex set
IWPEC'08 Proceedings of the 3rd international conference on Parameterized and exact computation
Satisfiability allows no nontrivial sparsification unless the polynomial-time hierarchy collapses
Proceedings of the forty-second ACM symposium on Theory of computing
Efficient approximation schemes for geometric problems?
ESA'05 Proceedings of the 13th annual European conference on Algorithms
Parameterized Complexity
Parameterized Complexity and Approximation Algorithms
The Computer Journal
| Hi-index | 0.00 |
We introduce a notion of approximation, called safe approximation, for minimization problems that are subset problems. We first study the relation between the standard notion of approximation and safe approximation, and show that the two notions are different unless some unlikely collapses in complexity theory occur. We then study the relation between safe approximation and kernelization. We demonstrate how the notion of safe approximation can be useful in designing kernelization algorithms for certain fixed-parameter tractable problems. On the other hand, we show that there are problems that have constant-ratio safe approximation algorithms but no polynomial kernels, unless the polynomial hierarchy collapses to the third level.