메뉴 건너뛰기




Volumn 2108, Issue , 2001, Pages 201-206

Approximation algorithms for the watchman route and zookeeper’s problems

Author keywords

[No Author keywords available]

Indexed keywords


EID: 0042526707     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44679-6_22     Document Type: Conference Paper
Times cited : (4)

References (3)
  • 3
    • 0001266603 scopus 로고    scopus 로고
    • Corrigendum to an incremental algorithm for constructing shortest watchman routes
    • X. Tan, T. Hirata and Y. Inagaki, Corrigendum to an incremental algorithm for constructing shortest watchman routes, Int. J. Comput. Geom. Appl. 9 (1999) 319-323.
    • (1999) Int. J. Comput. Geom. Appl , vol.9 , pp. 319-323
    • Tan, X.1    Hirata, T.2    Inagaki, Y.3


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