In this paper, we provide a study of Max-Min Fair (MMF) multicommodity flows and focus on some of their applications to multi-commodity networks. We first present the theoretical ...
Consider the following heuristic for planar Euclidean instances of the Traveling Salesman Problem (TSP): select a subset of the edges which induces a planar graph, and solve eithe...
In wireless ad hoc sensor networks, energy use is in many cases the most important constraint since it corresponds directly to operational lifetime. Topology management schemes su...
Quang Gao, Keith J. Blow, David J. Holding, Ian W....
Ensuring seamless mobility for users is becoming one of the main objectives of ongoing research activities in the field of data telecommunications. More over, if some proposals are...
Motivated by a problem on message routing in communication networks, Graham and Pollak proposed a scheme for addressing the vertices of a graph G by N-tuples of three symbols in s...
Randall J. Elzinga, David A. Gregory, Kevin N. Van...