Abstract
The Constrained Routing Problem is a multi-criteria optimization problem that captures the most important aspects of Quality of Service routing, and appears in many other practical problems. The problem is NP-hard, which causes exact solutions to require an intractable running time in the worst case, e-approximation algorithms provide a guaranteed approximate solution for all inputs while incurring a tractable (i.e., polynomial) computation time. This paper presents a performance evaluation of these two types of algorithms. The main performance criteria are accuracy and speed. © IFIP International Federation for Information Processing 2006.
Author supplied keywords
Cite
CITATION STYLE
Kuipers, F., Orda, A., Raz, D., & Van Mieghem, P. (2006). A comparison of exact and e-approximation algorithms for constrained routing. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3976 LNCS, pp. 197–208). Springer Verlag. https://doi.org/10.1007/11753810_17
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
