All reports by Author Martin Grohe:

__
TR07-106
| 10th September 2007
__

Yijia Chen, Martin Grohe, Magdalena GrĂ¼ber#### On Parameterized Approximability

__
TR07-091
| 10th September 2007
__

Martin Grohe#### Logic, Graphs, and Algorithms

__
TR06-011
| 2nd January 2006
__

Yijia Chen, Martin Grohe#### An Isomorphism between Subexponential and Parameterized Complexity Theory

Yijia Chen, Martin Grohe, Magdalena GrĂ¼ber

Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability.

The main intention of this theory is to deal with the efficient approximation of small cost solutions for optimisation problems.

Martin Grohe

Algorithmic meta theorems are algorithmic results that apply to whole families of combinatorial problems, instead of just specific problems. These families are usually defined in terms of logic and graph theory. An archetypal algorithmic meta theorem is Courcelle's Theorem, which states that all graph properties definable in monadic second-order logic ... more >>>

Yijia Chen, Martin Grohe

We establish a close connection between (sub)exponential time complexity and parameterized complexity by proving that the so-called miniaturization mapping is a reduction preserving isomorphism between the two theories.

more >>>