409 search results - page 1 / 82 » Polynomial Time Approximation Schemes and Parameterized Comp... |
MFCS
2004
Springer
15 years 7 months ago
2004
Springer
129
click to vote
MST
2007
15 years 1 months ago
2007
In 1996, Khanna and Motwani [KM96] proposed three logic-based optimization problems constrained by planar structure, and offered the hypothesis that these putatively fundamental ...
108
click to vote
TAMC
2009
Springer
15 years 9 months ago
2009
Springer
In this paper we define the notion of an f(k)-uniform parameterized exponential time scheme. We show that a problem can be solved in parameterized O(2o(f(k)) p(n)) time if and on...
CORR
2008
Springer
15 years 2 months ago
2008
Springer
Abstract. We consider approximating the minmax value of a multiplayer game in strategic form. Tightening recent bounds by Borgs et al., we observe that approximating the value with...
144
click to vote
CSR
2007
Springer
15 years 8 months ago
2007
Springer
The maximum constraint satisfaction problem (Max CSP) is the following computational problem: an instance is a finite collection of constraints on a set of variables, and the goal...