Sciweavers

123 search results - page 6 / 25
» The minimum Manhattan network problem: Approximations and ex...
Sort
View
WEA
2005
Springer
89views Algorithms» more  WEA 2005»
14 years 5 days ago
Implementation of Approximation Algorithms for the Multicast Congestion Problem
Abstract. We implement the approximation algorithm for the multicast congestion problem in communication networks in [14] based on the fast approximation algorithm for packing prob...
Qiang Lu, Hu Zhang
VTC
2006
IEEE
118views Communications» more  VTC 2006»
14 years 21 days ago
Minimum Energy Cooperative Path Routing in Wireless Networks: An Integer Programming Formulation
We study the problem of minimum energy cooperative path (MECP) routing in wireless networks. The joint problem of cooperative routing in wireless networks that combines route sele...
Fulu Li, Andrew Lippman, Kui Wu
TSP
2008
122views more  TSP 2008»
13 years 6 months ago
Quality of Service and Max-Min Fair Transmit Beamforming to Multiple Cochannel Multicast Groups
The problem of transmit beamforming to multiple cochannel multicast groups is considered, when the channel state is known at the transmitter and from two viewpoints: minimizing tot...
Eleftherios Karipidis, Nikos D. Sidiropoulos, Zhi-...
GECCO
2009
Springer
143views Optimization» more  GECCO 2009»
14 years 1 months ago
Exploiting hierarchical clustering for finding bounded diameter minimum spanning trees on euclidean instances
The bounded diameter minimum spanning tree problem is an NP-hard combinatorial optimization problem arising, for example, in network design when quality of service is of concern. ...
Martin Gruber, Günther R. Raidl
TCS
2008
13 years 6 months ago
Minimum-Energy Broadcast and disk cover in grid wireless networks
The Minimum-Energy Broadcast problem is to assign a transmission range to every station of an ad-hoc wireless networks so that (i) a given source station is allowed to perform bro...
Tiziana Calamoneri, Andrea E. F. Clementi, Miriam ...