Sciweavers

909 search results - page 120 / 182
» On the approximability of some network design problems
Sort
View
FOCS
2008
IEEE
16 years 21 days ago
Algorithms for Single-Source Vertex Connectivity
In the Survivable Network Design Problem (SNDP) the goal is to find a minimum cost subset of edges that satisfies a given set of pairwise connectivity requirements among the ver...
Julia Chuzhoy, Sanjeev Khanna
TC
2008
15 years 6 months ago
An Energy-Delay Tunable Task Allocation Strategy for Collaborative Applications in Networked Embedded Systems
Collaborative applications with energy and low-delay constraints are emerging in various networked embedded systems like wireless sensor networks and multimedia terminals. Conventi...
Tao Xie 0004, Xiao Qin
MOBIHOC
2008
ACM
16 years 5 months ago
Strong barrier coverage of wireless sensor networks
Constructing sensor barriers to detect intruders crossing a randomly-deployed sensor network is an important problem. Early results have shown how to construct sensor barriers to ...
Benyuan Liu, Olivier Dousse, Jie Wang, Anwar Saipu...
SENSYS
2003
ACM
15 years 11 months ago
SIA: secure information aggregation in sensor networks
Sensor networks promise viable solutions to many monitoring problems. However, the practical deployment of sensor networks faces many challenges imposed by real-world demands. Sen...
Bartosz Przydatek, Dawn Xiaodong Song, Adrian Perr...
171
Voted
BROADNETS
2006
IEEE
15 years 10 months ago
On Traffic Grooming Choices for IP over WDM networks
Traffic grooming continues to be a rich area of research in the context of WDM optical networks. We provide an overview of the optical and electronic grooming techniques available...
Srivatsan Balasubramanian, Arun K. Somani