393 search results - page 13 / 79 » Approximation Algorithm for Directed Telephone Multicast Pro... |
179
click to vote
ALGOSENSORS
2009
Springer
15 years 11 months ago
2009
Springer
A wireless ad-hoc network is a collection of transceivers positioned in the plane. Each transceiver is equipped with a limited battery charge. The battery charge is then reduced a...
158
click to vote
COMPUTING
2008
15 years 4 months ago
2008
Generalizing the approach of a previous work [15] the authors present multilevel preconditioners for three-dimensional (3D) elliptic problems discretized by a family of Rannacher ...
135
click to vote
COCOON
2008
Springer
15 years 6 months ago
2008
Springer
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
142
click to vote
MOBIHOC
2000
ACM
15 years 8 months ago
2000
ACM
— We present an approach to multicasting messages among highly mobile hosts in ad hoc networks. We suggest a new definition of a role-based multicast that suits the special need...
158
click to vote
ESA
2005
Springer
15 years 10 months ago
2005
Springer
We present two polynomial-time approximation algorithms for the metric case of the maximum traveling salesman problem. One of them is for directed graphs and its approximation rat...