Sciweavers

570 search results - page 21 / 114
» Approximating Some Network Design Problems with Node Costs
Sort
View
INFOCOM
2009
IEEE
15 years 8 months ago
Approximation Algorithms for Data Broadcast in Wireless Networks
—Broadcasting is a fundamental operation in wireless networks and plays an important role in the communication protocol design. In multihop wireless networks, however, interferen...
Rajiv Gandhi, Yoo-Ah Kim, Seungjoon Lee, Jiho Ryu,...
FOCS
2006
IEEE
15 years 7 months ago
Approximation Algorithms for Non-Uniform Buy-at-Bulk Network Design
We consider approximation algorithms for non-uniform buy-at-bulk network design problems. The first nontrivial approximation algorithm for this problem is due to Charikar and Kar...
Chandra Chekuri, Mohammad Taghi Hajiaghayi, Guy Ko...
HIS
2009
14 years 11 months ago
A Memetic Algorithm for the Generalized Minimum Vertex-Biconnected Network Problem
Abstract--The generalized minimum vertex-biconnected network problem plays an important role in the design of survivable backbone networks that should be fault tolerant to single c...
Bin Hu, Günther R. Raidl
AMC
2006
114views more  AMC 2006»
15 years 1 months ago
A multi-objective resource allocation problem in dynamic PERT networks
We develop a multi-objective model for the resource allocation problem in a dynamic PERT network, where the activity durations are exponentially distributed random variables and t...
Amir Azaron, Reza Tavakkoli-Moghaddam
GLOBECOM
2009
IEEE
15 years 5 months ago
Design and Provisioning of WDM Networks for Many-to-Many Traffic Grooming
A large number of network applications today allow several users to interact together using the many-to-many service mode. A many-to-many session consists of group of users (we ref...
Mohammad A. Saleh, Ahmed E. Kamal