Sciweavers

393 search results - page 13 / 79
» Approximation Algorithm for Directed Telephone Multicast Pro...
Sort
View
ALGOSENSORS
2009
Springer
14 years 1 months ago
Improved Approximation Algorithms for Maximum Lifetime Problems in Wireless Networks
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...
Zeev Nutov, Michael Segal
COMPUTING
2008
174views more  COMPUTING 2008»
13 years 6 months ago
Multilevel algorithms for Rannacher-Turek finite element approximation of 3D elliptic problems
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 ...
Ivan Georgiev, Johannes Kraus, Svetozar Margenov
COCOON
2008
Springer
13 years 8 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
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...
Ehab Morsy, Hiroshi Nagamochi
MOBIHOC
2000
ACM
13 years 11 months ago
Role-based multicast in highly mobile but sparsely connected ad hoc networks
— 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...
Linda Briesemeister, Günter Hommel
ESA
2005
Springer
98views Algorithms» more  ESA 2005»
14 years 7 days ago
Improved Approximation Algorithms for Metric Max TSP
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...
Zhi-Zhong Chen, Takayuki Nagoya