676 search results - page 50 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
117
click to vote
ISCAS
1999
IEEE
15 years 6 months ago
1999
IEEE
This paper considers the minimax filtering problem in which the supremum norm of weighted error sequence is minimized. It is shown that the minimax solution is also the optimal Se...
106
click to vote
STOC
2005
ACM
16 years 2 months ago
2005
ACM
We give a 1-pass ~O(m1-2/k )-space algorithm for computing the k-th frequency moment of a data stream for any real k > 2. Together with the lower bounds of [1, 2, 4], this reso...
139
click to vote
TMC
2011
14 years 9 months ago
2011
—We propose a method to compute a probably approximately correct (PAC) normalized histogram of observations with a refresh rate of Âð1Þ time units per histogram sample on a ra...
158
click to vote
IPCO
2001
15 years 3 months ago
2001
Problem (Extended Abstract) Cliff Stein David P. Wagner Dartmouth College Computer Science Technical Report TR2000-367 May 9, 2000 The problem of traversing a set of points in the...
160
click to vote
MFCS
2005
Springer
15 years 7 months ago
2005
Springer
We study simple greedy approximation algorithms for general class of integer packing problems. We provide a novel analysis based on the duality theory of linear programming. This e...