Sciweavers

52 search results - page 4 / 11
» Network design arc set with variable upper bounds
Sort
View
MOR
2007
149views more  MOR 2007»
13 years 8 months ago
LP Rounding Approximation Algorithms for Stochastic Network Design
Real-world networks often need to be designed under uncertainty, with only partial information and predictions of demand available at the outset of the design process. The field ...
Anupam Gupta, R. Ravi, Amitabh Sinha
INFOCOM
2008
IEEE
14 years 2 months ago
How Many Packets Can We Encode? - An Analysis of Practical Wireless Network Coding
— While the practical coding scheme [1] has been shown to be able to improve throughput of wireless networks, there still lacks fundamental understanding on how the coding scheme...
Jilin Le, John C. S. Lui, Dah-Ming Chiu
CIAC
2006
Springer
103views Algorithms» more  CIAC 2006»
14 years 5 days ago
Provisioning a Virtual Private Network Under the Presence of Non-communicating Groups
Virtual private network design in the hose model deals with the reservation of capacities in a weighted graph such that the terminals in this network can communicate with one anoth...
Friedrich Eisenbrand, Edda Happ
WINET
2008
86views more  WINET 2008»
13 years 8 months ago
Relay sensor placement in wireless sensor networks
This paper addresses the following relay sensor placement problem: given the set of duty sensors in the plane and the upper bound of the transmission range, compute the minimum nu...
Xiuzhen Cheng, Ding-Zhu Du, Lusheng Wang, Baogang ...
PIMRC
2008
IEEE
14 years 2 months ago
Constrained opportunistic power control in wireless networks
— In the opportunistic power control algorithm (OPC), designed in [1], [2], each user tries to keep the product of its transmit power and its experienced effective interference t...
Mehdi Rasti, Ahmad R. Sharafat