메뉴 건너뛰기




Volumn 3974 LNCS, Issue , 2006, Pages 261-274

Approximation bounds for black hole search problems

Author keywords

Approximation algorithm; Black hole search; Graph exploration; Inapproximability; Mobile agent

Indexed keywords

APPROXIMATION BOUNDS; APX-HARDNESS; BLACK HOLE SEARCH; BLACK HOLES; GRAPH EXPLORATION; INAPPROXIMABILITY; POLYNOMIAL-TIME; STATIONARY PROCESS;

EID: 48249123225     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11795490_21     Document Type: Conference Paper
Times cited : (4)

References (13)
  • 7
    • 84870774810 scopus 로고    scopus 로고
    • TSP with bounded metrics: Stronger approximation hardness
    • University of Bonn, February
    • L. Engebretsen and M. Karpinski. TSP with bounded metrics: stronger approximation hardness. Technical Report 85264, University of Bonn, February 2005.
    • (2005) Technical Report 85264
    • Engebretsen, L.1    Karpinski, M.2
  • 8
    • 0001943763 scopus 로고    scopus 로고
    • Time limited black box security: Protecting mobile agents from malicious hosts
    • Springer LNCS
    • F. Hohl. Time limited black box security: Protecting mobile agents from malicious hosts. In Proc. Conf. on Mobile Agent Security, Springer LNCS vol. 1419, pages 92-113, 1998.
    • (1998) Proc. Conf. on Mobile Agent Security , vol.1419 , pp. 92-113
    • Hohl, F.1
  • 12
    • 0003197918 scopus 로고    scopus 로고
    • Protecting mobile agents against malicious hosts
    • Springer LNCS
    • T. Sander and CF. Tschudin. Protecting mobile agents against malicious hosts. In Proc. Conf. on Mobile Agent Security, Springer LNCS vol. 1419, pages 44-60, 1998.
    • (1998) Proc. Conf. on Mobile Agent Security , vol.1419 , pp. 44-60
    • Sander, T.1    Tschudin, C.F.2


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