676 search results - page 85 / 136 » On Approximation Lower Bounds for TSP with Bounded Metrics |
DCOSS
2006
Springer
14 years 13 days ago
2006
Springer
Abstract. Today, there exist many algorithms and protocols for constructing agregation or dissemination trees for wireless sensor networks that are optimal (for different notions o...
ESA
2009
Springer
14 years 3 months ago
2009
Springer
We show that for every set S of n points in the plane and a designated point rt ∈ S, there exists a tree T that has small maximum degree, depth and weight. Moreover, for every po...
AINA
2007
IEEE
14 years 3 months ago
2007
IEEE
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
TIT
2008
13 years 8 months ago
2008
Abstract--The ranking problem has become increasingly important in modern applications of statistical methods in automated decision making systems. In particular, we consider a for...
VLDB
2004
ACM
14 years 2 months ago
2004
ACM
Existing studies on time series are based on two categories of distance functions. The first category consists of the Lp-norms. They are metric distance functions but cannot supp...