6 citations · 10 across the 3 of their papers we have counts for
3 papers
Is dynamic dedicated path protection tractable?
Ireneusz Szcześniak, Ireneusz Olszewski, Bożena Woźna-Szcześniak
Intractable is the problem of finding two link-disjoint paths of minimal cost if the path cost is limited since it can be a special case of the partition problem. In optical networ…
Generic Dijkstra
Ireneusz Szcześniak, Bożena Woźna-Szcześniak, Ireneusz Olszewski
The recently-proposed generic Dijkstra algorithm finds shortest paths in networks with continuous and contiguous resources. While the algorithm was proposed in the context of optic…
Towards an efficient and exact algorithm for dynamic dedicated path protection
Ireneusz Szcześniak, Ireneusz Olszewski, Bożena Woźna-Szcześniak
We present a novel algorithm for dynamic routing with dedicated path protection which, as the presented simulation results suggest, can be efficient and exact. We present the algor…