— This paper describes a novel, ultra-fast heuristic algorithm to address an NP-hard optimization problem. One of its significances is that, for the first time, the paper shows...
In an undirected, 2-node connected graph G = (V, E) with positive real edge lengths, the distance between any two nodes r and s is the length of a shortest path between r and s in ...
A linear program has a unique least 2-norm solution provided that the linear program has a solution. To locate this solution, most of the existing methods were devised to solve cer...
Abstract—The total transmission capacity required by a transport network to satisfy demand and protect it from failures contributes significantly to its cost, especially in long...
Rainer R. Iraschko, Mike H. MacGregor, Wayne D. Gr...
The weight of a randomly chosen link in the shortest path tree on the complete graph with exponential i.i.d. link weights is studied. The corresponding exact probability generatin...