Sciweavers

117 search results - page 8 / 24
» Hybrid constructive heuristics for the critical node problem
Sort
View
PPSN
2010
Springer
14 years 8 months ago
Variable Neighborhood Search and Ant Colony Optimization for the Rooted Delay-Constrained Minimum Spanning Tree Problem
Abstract. The rooted delay-constrained minimum spanning tree problem is an NP-hard combinatorial optimization problem arising for example in the design of centralized broadcasting ...
Mario Ruthmair, Günther R. Raidl
INFOCOM
2005
IEEE
15 years 4 months ago
Hybrid search schemes for unstructured peer-to-peer networks
— We study hybrid search schemes for unstructured peer-to-peer networks. We quantify performance in terms of number of hits, network overhead, and response time. Our schemes comb...
Christos Gkantsidis, Milena Mihail, Amin Saberi
TON
2010
171views more  TON 2010»
14 years 5 months ago
Constructing Maximum-Lifetime Data-Gathering Forests in Sensor Networks
Abstract--Energy efficiency is critical for wireless sensor networks. The data-gathering process must be carefully designed to conserve energy and extend network lifetime. For appl...
Yan Wu, Zhoujia Mao, Sonia Fahmy, Ness B. Shroff
INFOCOM
2008
IEEE
15 years 4 months ago
On the Construction of a Maximum-Lifetime Data Gathering Tree in Sensor Networks: NP-Completeness and Approximation Algorithm
Abstract—Energy efficiency is critical for wireless sensor networks. The data gathering process must be carefully designed to conserve energy and extend the network lifetime. Fo...
Yan Wu, Sonia Fahmy, Ness B. Shroff
IPPS
2005
IEEE
15 years 4 months ago
On Constructing k-Connected k-Dominating Set in Wireless Networks
An important problem in wireless networks, such as wireless ad hoc and sensor networks, is to select a few nodes to form a virtual backbone that supports routing and other tasks s...
Fei Dai, Jie Wu