Sciweavers

2862 search results - page 20 / 573
» Bicriteria Network Design Problems
Sort
View
FOCS
2008
IEEE
14 years 1 months ago
Degree Bounded Network Design with Metric Costs
Given a complete undirected graph, a cost function on edges and a degree bound B, the degree bounded network design problem is to find a minimum cost simple subgraph with maximum...
Yuk Hei Chan, Wai Shing Fung, Lap Chi Lau, Chun Ko...
STOC
2009
ACM
139views Algorithms» more  STOC 2009»
14 years 8 months ago
Online and stochastic survivable network design
Consider the edge-connectivity survivable network design problem: given a graph G = (V, E) with edge-costs, and edgeconnectivity requirements rij Z0 for every pair of vertices i,...
Anupam Gupta, Ravishankar Krishnaswamy, R. Ravi
ALGOSENSORS
2007
Springer
13 years 11 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
ICC
2007
IEEE
137views Communications» more  ICC 2007»
14 years 1 months ago
An Improved Topology Design Algorithm for Network Coding-Based Multicast Networks
— Future communication networks should be designed with the consideration of efficiently supporting intensive multicast applications. Network coding technique proposed recently ...
Kaikai Chi, Xiaohong Jiang, Susumu Horiguchi
EURONGI
2005
Springer
14 years 27 days ago
The State of the Art in Cross-Layer Design for Wireless Sensor Networks
Abstract. The literature on cross-layer protocols, protocol improvements, and design methodologies for wireless sensor networks (WSNs) is reviewed and a taxonomy is proposed. The c...
Tommaso Melodia, Mehmet C. Vuran, Dario Pompili