Art
J-GLOBAL ID：201502220038221353
Reference number：15A0793844
重みつき障害物を含む平面上での最短経路アルゴリズム
Author (2)：
,
Material：
Volume：
2015
Issue：
AL-152
Page：
VOL.2015-AL-152,NO.8 (WEB ONLY)
Publication year：
Feb. 24, 2015
JST Material Number：
U0451A
Document type：
Proceedings
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.
,
,
,
,
,
,
Semi 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.
,
JST classification (1)：
JST classification
Category name(code) classified by JST.
Basics of graph theory
Reference (3)：
-
John Hershberger and Subhash Suri, " An optimal algorithm for euclidean shortest paths in the plane", SIAM J.COMPUT, Volume 28, No.6, pp.2215-2256, 1999
-
Asano, T. and Doerr, B., " Memory-Constrained Algorithms for Shortest Path Problems", CCCG, 2011
-
Joseph S. B. Mitchell and Christos H. Papadimitriou, " The Weighted Region Problem: Finding Shortest Paths Through a Weighted Planar Subdivision", JACM, Volume 38 Issue 1, pp. 18-73, Jan. 1991
Terms in the title (2)：
Terms in the title
Keywords automatically extracted from the title.
,
Return to Previous Page
