Now showing items 1-2 of 2
Ordered Interval Routing Schemes
(University of Waterloo, 2004)
An <i>Interval Routing Scheme (IRS)</i> represents the routing tables in a network in a space-efficient way by labeling each vertex with an unique integer address and the outgoing edges at each vertex with disjoint ...
Constrained Shortest Paths in Terrains and Graphs
(University of Waterloo, 2009-10-28)
Finding a shortest path is one of the most well-studied optimization problems. In this thesis we focus on shortest paths in geometric and graph theoretic settings subject to different feasibility constraints that arise in ...