메뉴 건너뛰기




Volumn 12, Issue 1-2, 2002, Pages 29-66

Point set labeling with specified positions

Author keywords

Approximation algorithms; Cartography; Computational geometry; NP hardness

Indexed keywords


EID: 0036002797     PISSN: 02181959     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218195902000736     Document Type: Conference Paper
Times cited : (5)

References (36)
  • 6
    • 85029490640 scopus 로고
    • Static and dynamic algorithms for k-point clustering problems
    • Proc. 3rd Workshop on Algs. and Data Structures WADS-93, Springer-Verlag
    • (1993) LNCS , vol.709 , pp. 255-276
    • Datta, A.1    Lenhof, P.2    Schwarz, C.3    Smid, M.4
  • 16
    • 0022753024 scopus 로고
    • A unified approach to approximation algorithms for bottleneck problem
    • (1986) J. ACM , vol.33 , Issue.3 , pp. 533-550
    • Hochbaum, D.1    Shmoys, D.2
  • 35
    • 84927167443 scopus 로고    scopus 로고
    • New algorithms for two-label point labeling
    • Proc. 8th Annual Europ. Symp. on Algorithms ESA-00, Springer Verlag
    • (2000) LNCS , vol.1879 , pp. 368-379
    • Qin, Z.1    Wolff, A.2    Xu, Y.3    Zhu, B.4
  • 36
    • 0009916879 scopus 로고    scopus 로고


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