|
Volumn 2, Issue , 2001, Pages 743-749
|
A *Prune: An algorithm for finding K shortest paths subject to multiple constraints
a a |
Author keywords
Constraint based routing; Dijkstra algorithm; Multiple constrained path selection; NP complete; QoS routing; Shortest paths
|
Indexed keywords
ALGORITHMS;
APPROXIMATION THEORY;
BANDWIDTH;
CONSTRAINT THEORY;
ITERATIVE METHODS;
OPTIMIZATION;
POLYNOMIALS;
QUALITY OF SERVICE;
ROUTERS;
TELECOMMUNICATION NETWORKS;
DIJKSTRA ALGORITHM;
MULTIPLE CONSTRAINED SHORTEST PATH;
QUALITY OF SERVICE ROUTING;
DATA COMMUNICATION SYSTEMS;
|
EID: 0035019899
PISSN: 0743166X
EISSN: None
Source Type: Conference Proceeding
DOI: None Document Type: Conference Paper |
Times cited : (184)
|
References (23)
|