메뉴 건너뛰기




Volumn 21, Issue 1, 2001, Pages 15-25

On-line k-Truck Problem and Its Competitive Algorithms

Author keywords

Competitive algorithm; Competitive ratio; On line k truck problem; PMS

Indexed keywords


EID: 0035446130     PISSN: 09255001     EISSN: None     Source Type: Journal    
DOI: 10.1023/A:1017982528216     Document Type: Article
Times cited : (25)

References (9)
  • 2
    • 0028254345 scopus 로고
    • A new measure for the study of the on-line algorithm
    • Ben David, S. and Borodin, A. (1994), A new measure for the study of the on-line algorithm, Algorithmica 11: 73-91.
    • (1994) Algorithmica , vol.11 , pp. 73-91
    • Ben David, S.1    Borodin, A.2
  • 3
  • 4
    • 0029249995 scopus 로고
    • A graph-theoretic game and its application to the k-server problem
    • Alon, N., Karp, R.M. and Peleg, D. et al. (1995), A graph-theoretic game and its application to the k-server problem, SIAM J.Comput. 24(1): 78-100.
    • (1995) SIAM J.Comput. , vol.24 , Issue.1 , pp. 78-100
    • Alon, N.1    Karp, R.M.2    Peleg, D.3
  • 6
  • 9
    • 0348036009 scopus 로고    scopus 로고
    • On-line k-taxi scheduling on a constrained graph and its competitive algorithm
    • P.R. China
    • Xu, Y.F., Wang, K.L. and Ding, J.H. (1999), On-line k-taxi scheduling on a constrained graph and its competitive algorithm, Journal of System Engineering (P.R. China), No. 4..
    • (1999) Journal of System Engineering , Issue.4
    • Xu, Y.F.1    Wang, K.L.2    Ding, J.H.3


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