3475 search results - page 169 / 695 » Backbones in Optimization and Approximation |
184
click to vote
TSP
2008
15 years 4 months ago
2008
The basic nonlinear filtering problem for dynamical systems is considered. Approximating the optimal filter estimate by particle filter methods has become perhaps the most common a...
164
click to vote
SODA
2003
ACM
15 years 7 months ago
2003
ACM
We present a hierarchical scheme for efficiently maintaining all-pairs approximate shortest-paths in undirected unweighted graphs under deletions of edges. An α-approximate short...
156
click to vote
TC
2008
15 years 6 months ago
2008
This paper examines the hardware implementation trade-offs when evaluating functions via piecewise polynomial approximations and interpolations for precisions of up to 24 bits. In ...
196
click to vote
SODA
2010
ACM
16 years 3 months ago
2010
ACM
The minimum latency problem (MLP) is a well-studied variant of the traveling salesman problem (TSP). In the MLP, the server's goal is to minimize the average latency that the...
180
click to vote
STACS
2009
Springer
16 years 1 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...