메뉴 건너뛰기




Volumn 50, Issue 1, 2008, Pages 58-71

An optimal algorithm for the minimum disc cover problem

Author keywords

hull; Applications in ad hoc networks; Minimum disc cover; Optimal algorithms

Indexed keywords

MINIMUM DISC COVER; OPTIMAL ALGORITHMS;

EID: 37449007734     PISSN: 01784617     EISSN: 14320541     Source Type: Journal    
DOI: 10.1007/s00453-007-9043-4     Document Type: Article
Times cited : (5)

References (13)
  • 3
    • 0002284940 scopus 로고
    • On the complexity of computations under varying sets of primitives
    • Dobkin, D.P., Lipton, R.J.: On the complexity of computations under varying sets of primitives. J. Comput. Syst. Sci. 18, 86-91 (1979)
    • (1979) J. Comput. Syst. Sci. , vol.18 , pp. 86-91
    • Dobkin, D.P.1    Lipton, R.J.2
  • 13
    • 0036498659 scopus 로고    scopus 로고
    • The broadcast storm problem in a mobile ad hoc network
    • 2/3
    • Tseng, Y.-C., Ni, S.-Y., Chen, Y.-S., Sheu, J.-P.: The broadcast storm problem in a mobile ad hoc network. Wirel. Netw. 8(2/3), 153-167 (2002)
    • (2002) Wirel. Netw. , vol.8 , pp. 153-167
    • Tseng, Y.-C.1    Ni, S.-Y.2    Chen, Y.-S.3    Sheu, J.-P.4


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