752 search results - page 82 / 151 » Faster approximation algorithms for the minimum latency prob... |
140
click to vote
STACS
2009
Springer
15 years 10 months ago
2009
Springer
Abstract. We present approximation algorithms for almost all variants of the multicriteria traveling salesman problem (TSP), whose performances are independent of the number k of c...
125
click to vote
ALGORITHMICA
2004
15 years 3 months ago
2004
We investigate the diameter problem in the streaming and slidingwindow models. We show that, for a stream of n points or a sliding window of size n, any exact algorithm for diamet...
148
Voted
ESA
2005
Springer
15 years 8 months ago
2005
Springer
This paper investigates, for the first time in the literature, the approximation of min-max (regret) versions of classical problems like shortest path, minimum spanning tree, and ...
166
click to vote
IMCSIT
2010
15 years 1 months ago
2010
This paper studies the minimum latency broadcast schedule (MLBS) problem in ad hoc networks represented by unit disk graphs. In our approach we use an algorithm, which does not nee...
123
click to vote
ATAL
2007
Springer
15 years 9 months ago
2007
Springer
Reinforcement learning promises a generic method for adapting agents to arbitrary tasks in arbitrary stochastic environments, but applying it to new real-world problems remains di...