In this paper we compare the performance of tree different dynamic traffic engineering algorithms exploiting path diversity in the Internet, TEXCP, TRUMP and MIRTO. We passed throu...
This paper presents a dynamic (or multi-period) hub location problem. It proposes a branch-and-bound algorithm that uses a Lagrangean relaxation to obtain lower and upper bounds a...
: The topological pressure of dynamical systems theory is examined from a computability theoretic point of view. It is shown that for sofic shift dynamical systems, the topological...
We present a new data structure that facilitates approximate nearest neighbor searches on a dynamic set of points in a metric space that has a bounded doubling dimension. Our data...
The problem of maintaining a representation of a dynamic graph as long as a certain property is satisfied has recently been considered for a number of properties. This paper prese...