676 search results - page 51 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
129
click to vote
IDA
2007
Springer
15 years 1 months ago
2007
Springer
Abstract. This paper introduces a new algorithm for approximate mining of frequent patterns from streams of transactions using a limited amount of memory. The proposed algorithm co...
JC
2006
15 years 1 months ago
2006
We study the randomized approximation of weakly singular integral operators. For a suitable class of kernels having a standard type of singularity and being otherwise of finite sm...
FOCS
2009
IEEE
15 years 8 months ago
2009
IEEE
Abstract— Applications in complex systems such as the Internet have spawned recent interest in studying situations involving multiple agents with their individual cost or utility...
107
click to vote
ALDT
2009
Springer
15 years 8 months ago
2009
Springer
Traditional performance analysis of approximation algorithms considers overall performance, while economic fairness analysis focuses on the individual performance each user receiv...
153
click to vote
COMPGEOM
1992
ACM
15 years 6 months ago
1992
ACM
Suppose we are given a sequence of n points in the Euclidean plane, and our objective is to construct, on-line, a connected graph that connects all of them, trying to minimize the...