Sciweavers

205 search results - page 1 / 41
» On Parameterized Approximability
Sort
View
ECCC
2007
86views more  ECCC 2007»
13 years 4 months ago
On Parameterized Approximability
Abstract. Combining classical approximability questions with parameterized complexity, we introduce a theory of parameterized approximability. The main intention of this theory is ...
Yijia Chen, Martin Grohe, Magdalena Grüber
COCO
2010
Springer
180views Algorithms» more  COCO 2010»
13 years 9 months ago
Completely Inapproximable Monotone and Antimonotone Parameterized Problems
We prove that weighted monotone/antimonotone circuit satisfiability has no fixed-parameter tractable approximation algorithm with any approximation ratio function ρ, unless FPT...
Dániel Marx
ESA
2010
Springer
227views Algorithms» more  ESA 2010»
13 years 6 months ago
Approximating Parameterized Convex Optimization Problems
We consider parameterized convex optimization problems over the unit simplex, that depend on one parameter. We provide a simple and efficient scheme for maintaining an -approximat...
Joachim Giesen, Martin Jaggi, Sören Laue
JDA
2006
90views more  JDA 2006»
13 years 4 months ago
An improved approximation algorithm for the asymmetric TSP with strengthened triangle inequality
We consider the asymmetric traveling salesperson problem with -parameterized triangle inequality for [1/2, 1). That means, the edge weights fulfill w(u, v)
Markus Bläser, Bodo Manthey, Jiri Sgall
COCOON
2001
Springer
13 years 9 months ago
Decidable Approximations on Generalized and Parameterized Discrete Timed Automata
We consider generalized discrete timed automata with general linear relations over clocks and parameterized constants as clock constraints and with parameterized durations. We look...
Zhe Dang, Oscar H. Ibarra, Richard A. Kemmerer