7006 search results - page 146 / 1402 » Approximation Algorithms |
170
Voted
APPROX
2000
Springer
15 years 7 months ago
2000
Springer
Given a graph (directed or undirected) with costs on the edges, and an integer k, we consider the problem of nding a k-node connected spanning subgraph of minimum cost. For the ge...
120
Voted
ICIP
1999
IEEE
16 years 4 months ago
1999
IEEE
This paper presents an iterative algorithm for approximating gray-scale images with adaptive triangular meshes ensuring a given tolerance. At each iteration, the algorithm applies...
124
click to vote
ICALP
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We give an fpt approximation algorithm for the directed vertex disjoint cycle problem. Given a directed graph G with n vertices and a positive integer k, the algorithm co...
124
Voted
CDC
2010
IEEE
14 years 9 months ago
2010
IEEE
Abstract-- We consider reinforcement learning, and in particular, the Q-learning algorithm in large state and action spaces. In order to cope with the size of the spaces, a functio...
86
Voted
TCS
2002
15 years 2 months ago
2002
Under the hypothesis that NP has positive p-dimension, we prove that any approximation algorithm A for MAX3SAT must satisfy at least one of the following: