7006 search results - page 177 / 1402 » Approximation Algorithms |
111
click to vote
ESA
2009
Springer
15 years 9 months ago
2009
Springer
Abstract. The input of the Edge Multicut problem consists of an undirected graph G and pairs of terminals {s1, t1}, . . . , {sm, tm}; the task is to remove a minimum set of edges s...
147
click to vote
ALGORITHMICA
1998
15 years 2 months ago
1998
In this paper we give a fully dynamic approximation scheme for maintaining all-pairs shortest paths in planar networks. Given an error parameter ε such that 0 < ε, our algorit...
143
click to vote
IPL
2002
15 years 2 months ago
2002
The area of approximation algorithms for the Steiner tree problem in graphs has seen continuous progress over the last years. Currently the best approximation
116
click to vote
CAGD
2006
15 years 3 months ago
2006
We suggest a local hybrid approximation scheme based on polynomials and radial basis functions, and use it to modify the scattered data fitting algorithm of [7]. Similar to that a...
128
click to vote
ICML
2004
IEEE
16 years 3 months ago
2004
IEEE
Synchronous reinforcement learning (RL) algorithms with linear function approximation are representable as inhomogeneous matrix iterations of a special form (Schoknecht & Merk...