Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

10

ECCC
2007

favoriteEmaildiscussreport

86views more ECCC 2007»

On Parameterized Approximability

13 years 4 months ago

On Parameterized Approximability

Download www2.informatik.hu-berlin.de

Abstract. 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 efﬁcient approximation of small cost solutions for optimisation problems. Key words. Fixed-parameter tractability, approximation algorithms, hardness of approximation.

Yijia Chen, Martin Grohe, Magdalena Grüber

Real-time Traffic

Approximation | Classical Approximability Questions | ECCC 2007 | Parameterized Approximability |

claim paper

Related Content

» Completely Inapproximable Monotone and Antimonotone Parameterized Problems

» Approximating Parameterized Convex Optimization Problems

» An improved approximation algorithm for the asymmetric TSP with strengthened triangle ineq...

» Decidable Approximations on Generalized and Parameterized Discrete Timed Automata

» Constant Ratio FixedParameter Approximation of the Edge Multicut Problem

» Parameterizing pair approximations for takeover dynamics

» Sketch Parameterization Using Curve Approximation

» Robust fuzzy control of nonlinear systems using shapeadaptive radial basis functions

» Parameterized Approximability of the Disjoint Cycle Problem

Post Info
More Details (n/a)

Added	13 Dec 2010
Updated	13 Dec 2010
Type	Journal
Year	2007
Where	ECCC
Authors	Yijia Chen, Martin Grohe, Magdalena Grüber

Comments (0)