Art
J-GLOBAL ID：200902018399376007   Reference number：88A0571685

An approximation algorithm for the shortest path problem between a specified pair of nodes on a road network.

道路網上での2点間の最短路問題の近似算法
Author (3)：
NAKATANI NAYUMI

About NAKATANI NAYUMI

(金沢工大 大学院)

About 金沢工大 大学院

, 
MIHARA ICHIRO

About MIHARA ICHIRO

(金沢工大)

About 金沢工大

, 
SUMINOKURA TOSHIHIKO

About SUMINOKURA TOSHIHIKO

(金沢工大)

About 金沢工大


Material：
金沢工業大学研究紀要 A  (Memoirs of Kanazawa Institute of Technology. A)

About 金沢工業大学研究紀要 A


Issue： 27  Page： 21-37  Publication year： May. 1988 
JST Material Number： S0920A  ISSN： 0388-5801  Document type： Article
Article type： 原著論文  Country of issue： Japan (JPN)  Language： JAPANESE (JA)
Thesaurus term：
Thesaurus term/Semi thesaurus term
Keywords indexed to the article.
All keywords is available on JDreamIII(charged).
On J-GLOBAL, this item will be available after more than half a year after the record posted. In addtion, medical articles require to login to MyJ-GLOBAL.
road network

About road network

,...
   To see more with JDream III (charged).   {{ this.onShowAbsJLink("http://jdream3.com/lp/jglobal/index.html?docNo=88A0571685&from=J-GLOBAL&jstjournalNo=S0920A") }}
JST classification (2)：
JST classification
Category name(code) classified by JST.
Road engineering in general 
(RC08010M)

About Road engineering in general

,  Other methods of operations research 
(KA03070E)

About Other methods of operations research

Terms in the title (4)：
Terms in the title
Keywords automatically extracted from the title.
道路網

About 道路網

, 
最短路問題

About 最短路問題

, 
近似

About 近似

, 
算法

About 算法


Return to Previous Page

TOP

BOTTOM