On the complexity of quality of service routing

• 1 February 1999
• journal article
• Published by Elsevier in Information Processing Letters
• Vol. 69  (3) , 111-114
• https://doi.org/10.1016/s0020-0190(98)00206-3

Abstract

Keywords

• COMPUTATIONAL COMPLEXITY
• NP-COMPLETENESS
• ROUTING
• SHORTEST PATH
• MULTIPLE CONSTRAINTS