메뉴 건너뛰기





Volumn 2, Issue , 2001, Pages 743-749

A *Prune: An algorithm for finding K shortest paths subject to multiple constraints

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;

EID: 0035019899     PISSN: 0743166X     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (184)

References (23)
  • Reference 정보가 존재하지 않습니다.

* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.