4843 search results - page 71 / 969 » The Shortcut Problem - Complexity and Approximation |
CDC
2009
IEEE
15 years 2 months ago
2009
IEEE
—TD learning and its refinements are powerful tools for approximating the solution to dynamic programming problems. However, the techniques provide the approximate solution only...
CORR
2004
Springer
14 years 9 months ago
2004
Springer
We survey results on the hardness of approximating combinatorial optimization problems. Contents
105
click to vote
EVOW
2006
Springer
15 years 1 months ago
2006
Springer
Abstract. We present the newly developed core concept for the Multidimensional Knapsack Problem (MKP) which is an extension of the classical concept for the one-dimensional case. T...
FOCS
2009
IEEE
15 years 4 months ago
2009
IEEE
We show that a k-fold covering using translates of an arbitrary convex polygon can be decomposed into Omega(k) covers (using an efficient algorithm). We generalize this result to ...
JCO
2008
14 years 10 months ago
2008
In this paper we present two main results about the inapproximability of the exemplar conserved interval distance problem of genomes. First, we prove that it is NP-complete to deci...