The Community for Technology Leaders
Green Image
We propose six new heuristics to find a source-to-destination path that satisfies two or more additive constraints on edge weights. Five of these heuristics become \epsilon{\hbox{-}}{\rm approximation} algorithms when their parameters are appropriately set. The performance of our new heuristics is compared experimentally with that of two recently proposed heuristics for the same problem.
Quality of service routing, interval partitioning, approximation algorithm, heuristic.
Meongchul Song, Sartaj Sahni, "Approximation Algorithms for Multiconstrained Quality-of-Service Routing", IEEE Transactions on Computers, vol. 55, no. , pp. 603-617, May 2006, doi:10.1109/TC.2006.67
82 ms
(Ver 3.3 (11022016))