654 search results - page 78 / 131 » An efficient approximation algorithm for the survivable netw... |
DCOSS
2011
Springer
12 years 8 months ago
2011
Springer
—Sensor networks are often redundant by design; this is often done in order to achieve reliability in information processing. In many cases, the redundancy relationships between ...
CORR
2010
Springer
13 years 5 months ago
2010
Springer
In the oblivious buy-at-bulk network design problem in a graph, the task is to compute a fixed set of paths for every pair of source-destination in the graph, such that any set of ...
WAIM
2004
Springer
14 years 2 months ago
2004
Springer
Abstract. Web caching plays an important role in many network services. Utilization of the cache in each level (server, proxy, and client) of network forms a web caching hierarchy....
TON
2008
13 years 8 months ago
2008
Abstract-- In this paper we study the computational complexity and effectiveness of a concept we term "N-hub ShortestPath Routing" in IP networks. N-hub Shortest-Path Rou...
ISAAC
2010
Springer
13 years 6 months ago
2010
Springer
We study the NP-complete TARGET SET SELECTION (TSS) problem occurring in social network analysis. Complementing results on its approximability and extending results for its restric...