Data management and routing in general networks / [of Harald Räcke]. 2003
Content
- Introduction
- Comm.-efficient DMS
- Formal description of the problems
- Related work and new results
- Hierarchy-based algorithms
- Preliminaries
- The bisimulation technique
- The virtual tree network
- Simulation results
- Applications
- Constructing the hierarchical decomposition
- Optimal oblivious routing
- Conclusions
- Cost-efficient DMS
- The cost based model
- Related work and new results
- The approximation algorithm for arbitrary networks
- The optimal algorithm for trees
- Conclusions
- Appendix