Routing in Very Large Multi-Modal Time Dependent Networks: Theory and Practice (Invited Talk)

In many path nding problems arising in diverse areas, such as transportation science [8], web search [4], database queries [1], [28], [42] and VLSI design certain patterns of edge/vertex labels in the labeled graph being traversed are allowed/preferred, while others are disallowed. Thus, the feasibility of a path is determined by (i) its length (or cost) under well known measures on graphs such as distance, and (ii) its associated label. In such a setting, many practical problems can be equivalently cast as multi-constrained shortest/simple path problems. An illustrative example is the problem of nding a fastest path in time dependent networks that have piecewise linear link traversal functions with the additional constraint that the label of the path belongs to a user speci ed regular grammar.