Access

    Access via TIB

    Check availability in my library

    Order at Subito €


    Export, share and cite



    Title :

    Approximate Shortest Path Algorithms for Network-Tree Model


    Contributors:
    Tan, G. (author) / Han, X. (author) / Zhao, Y. (author) / IEEE

    Conference:

    International conference; 6th, Intelligent transportation systems ; 2003 ; Shanghai, China



    Publication date :

    2003-01-01


    Size :

    6 pages


    Remarks:

    Also known as ITSC 2003. IEEE cat no 03TH8708



    Type of media :

    Conference paper


    Type of material :

    Print


    Language :

    English




    Approximate shortest path algorithms for network-tree model

    Guozhen Tan, / Xiaojun Han, / Yilin Zhao, | IEEE | 2003


    Urban K shortest path obtaining method based on shortest path tree

    DING JIANXUN / YANG BEINUO / DUAN RUI et al. | European Patent Office | 2024

    Free access

    Dynamic shortest path algorithms for IVHS applications

    Farkas, András, 1965- | DSpace@MIT | 1993

    Free access


    A performance analysis of hierarchical shortest path algorithms

    Fetterer, A. / Shekhar, S. | Tema Archive | 1997