Maximum bandwidth routing and maximum flow routing in
โ Scribed by Chia-Cheng Hu; Yu-Liang Kuo; Chun-Yuan Chiu; Yueh-Min Huang
- Book ID
- 106542660
- Publisher
- Springer US
- Year
- 2009
- Tongue
- English
- Weight
- 633 KB
- Volume
- 44
- Category
- Article
- ISSN
- 1018-4864
No coin nor oath required. For personal study only.
๐ SIMILAR VOLUMES
In this paper, we present a data aggregated maximum lifetime routing scheme for wireless sensor networks. We address the problem of jointly optimizing data aggregation and routing so that the network lifetime can be maximized. A recursive smoothing method is adopted to overcome the non-differentiabi
## Abstract We determine how much the bandwidth __B__(__G__) of a graph __G__ can increase when a single edge is added. Let __g__(__b,n__) be the maximum possible value of __B__(__G__ + __e__) when __G__ has __n__ vertices and bandwidth __b__. The problem of studying when __B__(__G__ + __e__) โฆ __B