Title of article :
On the complexity of quality of service routing
Author/Authors :
Zheng Wang، نويسنده ,
Issue Information :
دوهفته نامه با شماره پیاپی سال 1999
Pages :
4
From page :
111
To page :
114
Keywords :
computational complexity , routing , Multiple constraints , Shortest path , NP-completeness
Journal title :
Information Processing Letters
Serial Year :
1999
Journal title :
Information Processing Letters
Record number :
129025
Link To Document :
https://search.isc.ac/dl/search/defaultta.aspx?DTC=10&DC=129025
