676 search results - page 78 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
170
click to vote
ICDE
2006
IEEE
16 years 6 days ago
2006
IEEE
Widespread interest in time-series similarity search has made more in need of efficient technique, which can reduce dimensionality of the data and then to index it easily using a ...
160
click to vote
COCOON
2005
Springer
15 years 11 months ago
2005
Springer
Abstract. We present three streaming algorithms that ( , δ)− approximate 1 the number of triangles in graphs. Similar to the previous algorithms [3], the space usage of presente...
174
click to vote
ESA
2001
Springer
15 years 10 months ago
2001
Springer
In this paper we introduce a general strategy for approximating the solution to minimisation problems in random regular graphs. We describe how the approach can be applied to the m...
180
click to vote
COCOON
2004
Springer
15 years 10 months ago
2004
Springer
In this work, we study an extension of the k-center facility location problem, where centers are required to service a minimum of clients. This problem is motivated by requirement...
151
click to vote
CJ
2010
15 years 6 months ago
2010
A silent self-stabilizing asynchronous distributed algorithms is given for constructing a kdominating set, and hence a k-clustering, of a connected network of processes with uniqu...