654 search results - page 5 / 131 » An efficient approximation algorithm for the survivable netw... |
INFOCOM
2008
IEEE
14 years 1 months ago
2008
IEEE
— The relay node placement problem for wireless sensor networks is concerned with placing a minimum number of relay nodes into a wireless sensor network to meet certain connectiv...
QOSIP
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. The topological design of distributed packet switched networks consists of finding a topology that minimizes the communication costs by taking into account a certain num...
ESA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
OL
2008
13 years 7 months ago
2008
Building on an existing 2-approximate algorithm for the class of network design problems with downwards-monotone demand functions, many of which are NP-hard, we present an algorith...
NETWORKING
2000
13 years 9 months ago
2000
Abstract. The design of survivable mesh based STM networks has received considerable attention in recent years and is a complex multiconstraint optimization problem. In this paper,...