Algorithms and Models for Problems in Networking

Many interesting theoretical problems arise from computer networks. In this thesis we will consider three of them: algorithms and data structures for problems involving distances in networks (in particular compact routing schemes, distance labels, and distance oracles), algorithms for wireless capac...

Full description

Bibliographic Details
Main Author: Dinitz, Michael
Format: Others
Published: Research Showcase @ CMU 2010
Subjects:
BGP
Online Access:http://repository.cmu.edu/dissertations/9
http://repository.cmu.edu/cgi/viewcontent.cgi?article=1006&context=dissertations