36 search results - page 7 / 8 » Approximation Algorithms for Multicommodity-Type Problems wi... |
134
Voted
PODC
2005
ACM
15 years 9 months ago
2005
ACM
Many large-scale networks such as ad hoc and sensor networks, peer-to-peer networks, or the Internet have the property that the number of independent nodes does not grow arbitrari...
114
Voted
DATE
2002
IEEE
15 years 8 months ago
2002
IEEE
In this paper, we address the problem of simultaneous routing and buffer insertion. Recently in [12, 22], the authors considered simultaneous maze routing and buffer insertion und...
174
Voted
ALGOSENSORS
2009
Springer
15 years 1 months ago
2009
Springer
Abstract. We describe a novel approach for constructing a single spanning tree for data aggregation towards a sink node. The tree is universal in the sense that it is static and in...
154
Voted
CORR
2010
Springer
15 years 3 months ago
2010
Springer
Bargaining networks model the behavior of a set of players who need to reach pairwise agreements for making profits. Nash bargaining solutions in this context correspond to soluti...
150
Voted
MOBIHOC
2008
ACM
16 years 3 months ago
2008
ACM
A Connected Dominating Set (CDS) working as a virtual backbone is an effective way to decrease the overhead of routing in a wireless sensor network. Furthermore, a kConnected m-Do...