632 search results - page 88 / 127 » On the Approximability of the Steiner Tree Problem |
SODA
2007
ACM
13 years 9 months ago
2007
ACM
This paper addresses the basic question of how well can a tree approximate distances of a metric space or a graph. Given a graph, the problem of constructing a spanning tree in a ...
ADHOC
2005
13 years 7 months ago
2005
In ad hoc wireless networks, nodes are typically powered by batteries. Therefore saving energy has become a very important objective, and different algorithms have been proposed t...
Publication
We consider the computational problem of finding nearest neighbors in general metric spaces. Of particular interest are spaces that may not be conveniently embedded or approximate...
INFOCOM
1999
IEEE
13 years 12 months ago
1999
IEEE
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
COMPGEOM
2007
ACM
13 years 11 months ago
2007
ACM
The paper consists of two major parts. In the first part, we re-examine relative -approximations, previously studied in [12, 13, 18, 25], and their relation to certain geometric p...