메뉴 건너뛰기




Volumn 10, Issue 2, 1998, Pages 163-177

Approximating shortest paths in large-scale networks with an application to intelligent transportation systems

Author keywords

Distance algorithms; Graphs; Networks; Traffic models

Indexed keywords


EID: 0003021178     PISSN: 10919856     EISSN: None     Source Type: Journal    
DOI: 10.1287/ijoc.10.2.163     Document Type: Article
Times cited : (45)

References (10)
  • 2
    • 20944433502 scopus 로고
    • The Coupon-Collector Problem Revisited
    • Computer Sciences Department, Purdue University, West Lafayette, Indiana
    • A. BONEH and M. HOFRI, 1990. The Coupon-Collector Problem Revisited. Technical Report CSD-TR-952, Computer Sciences Department, Purdue University, West Lafayette, Indiana.
    • (1990) Technical Report CSD-TR-952
    • Boneh, A.1    Hofri, M.2
  • 3
    • 0024302295 scopus 로고
    • A New Approach to the Analysis of Random Methods for Detecting Necessary Linear Inequality Constraints
    • R.J. CARON and J.F. MCDONALD, 1989. A New Approach to the Analysis of Random Methods for Detecting Necessary Linear Inequality Constraints. Mathematical Programming 43, 97-102.
    • (1989) Mathematical Programming , vol.43 , pp. 97-102
    • Caron, R.J.1    Mcdonald, J.F.2
  • 6
    • 0001623204 scopus 로고
    • A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures
    • M.B. HABBAL, H.N. KOUTSOPOULOS, and S.R. LERMAN, 1994. A Decomposition Algorithm for the All-Pairs Shortest Path Problem on Massively Parallel Computer Architectures. Transportation Science 28:4, 292-308.
    • (1994) Transportation Science , vol.28 , Issue.4 , pp. 292-308
    • Habbal, M.B.1    Koutsopoulos, H.N.2    Lerman, S.R.3
  • 7
    • 0002607217 scopus 로고
    • Fastest Paths in Time-Dependent Networks for IVHS Applications
    • D.E. KAUFMAN and R.L. SMITH, 1993. Fastest Paths in Time-Dependent Networks for IVHS Applications. IVHS Journal 1:1, 1-11.
    • (1993) IVHS Journal , vol.1 , Issue.1 , pp. 1-11
    • Kaufman, D.E.1    Smith, R.L.2
  • 8
    • 21144468209 scopus 로고
    • Level graphs and approximate shortest path algorithms
    • J. SHAPIRO, J. WAXMAN, and D. NIR, 1992. Level graphs and approximate shortest path algorithms. Networks 22, 691-717.
    • (1992) Networks , vol.22 , pp. 691-717
    • Shapiro, J.1    Waxman, J.2    Nir, D.3
  • 9
    • 0346310505 scopus 로고
    • Large Scale Traffic Modeling for Route-Guidance Evaluation: A Case Study
    • The University of Michigan, Ann Arbor, MI
    • K.E. WUNDERLICH and R.L. SMITH, 1992. Large Scale Traffic Modeling for Route-Guidance Evaluation: A Case Study. IVHS Technical Report 92-08, The University of Michigan, Ann Arbor, MI.
    • (1992) IVHS Technical Report 92-08
    • Wunderlich, K.E.1    Smith, R.L.2
  • 10
    • 85072424455 scopus 로고
    • Quick Route-Finding Algorithm
    • Toyota Motor Corp. and Matsushita Electric Industrial Co., Ltd., Tokyo
    • T. YAGYU, M. FUSHIMI, Y. UEYAMA, and S. AZUMA, 1993. Quick Route-Finding Algorithm. Technical report, Toyota Motor Corp. and Matsushita Electric Industrial Co., Ltd., Tokyo.
    • (1993) Technical Report
    • Yagyu, T.1    Fushimi, M.2    Ueyama, Y.3    Azuma, S.4


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