Title :
A Fast Hybrid ε-Approximation Algorithm for Computing Constrained Shortest Paths
Author :
Gang Feng ; Korkmaz, Turgay
Author_Institution :
Electr. Eng. Dept., Univ. of Wisconsin, Platteville, WI, USA
Abstract :
Considerable efforts have been dedicated to develop both heuristic and approximation algorithms for the NP-complete delay-constrained least-cost (DCLC) routing problem, but to the best of our knowledge, no prior work has been done to mingle the two tracks of research. In this letter we introduce a novel idea to show how a heuristic method can be used to boost the average performance of an approximation algorithm. Simulations on networks of up to 8192 nodes demonstrate that our new hybrid ε-approximation algorithm is faster than the best known approximation algorithm by one or two orders of magnitude (depending on the network size and ε).
Keywords :
approximation theory; graph theory; optimisation; telecommunication network routing; DCLC routing problem; NP-complete delay-constrained least-cost routing problem; approximation algorithms; average performance; computing constrained shortest paths; heuristic algorithms; hybrid ε-approximation algorithm; Approximation algorithms; Approximation methods; Complexity theory; Delays; Heuristic algorithms; Routing; Upper bound; Delay-constrained least cost routing; approximation algorithm; heuristic algorithm; multi-constrained path;
Journal_Title :
Communications Letters, IEEE
DOI :
10.1109/LCOMM.2013.052413.130811
