16 search results - page 2 / 4 » Constant Time per Edge is Optimal on Rooted Tree Networks |
ESA
2007
Springer
13 years 11 months ago
2007
Springer
Consider the following network subscription pricing problem. We are given a graph G = (V, E) with a root r, and potential customers are companies headquartered at r with locations...
DMTCS
2010
13 years 2 months ago
2010
This paper studies the fundamental trade-off between communication cost and delay cost arising in various contexts such as control message aggregation or organization theory. An o...
ADHOCNOW
2008
Springer
13 years 6 months ago
2008
Springer
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network...
AHSWN
2010
13 years 5 months ago
2010
We study the problem of gathering information from the nodes of a multi-hop radio network into a pre-defined destination node under the interference constraints. In such a network,...
TON
2012
11 years 7 months ago
2012
—In order to achieve resilient multipath routing we introduce the concept of Independent Directed Acyclic Graphs (IDAGs) in this study. Link-independent (Node-independent) DAGs s...