메뉴 건너뛰기




Volumn 28, Issue 3, 2002, Pages 369-381

Dynamics of heuristic optimization algorithms on random graphs

Author keywords

02.50. r Probability theory, stochastic processes, and statistics; 89.20. a Interdisciplinary applications of physics; 89.20.Ff Computer science and technology

Indexed keywords


EID: 0012229968     PISSN: 14346028     EISSN: None     Source Type: Journal    
DOI: 10.1140/epjb/e2002-00240-8     Document Type: Article
Times cited : (21)

References (29)
  • 2
    • 0042677090 scopus 로고    scopus 로고
    • note
    • Please note that "approximation" is not used in the sense of a polynomial-time approximation scheme, which guarantees to approximate the optimal solution within some given error for arbitrary samples. Here we mean low-cost configurations which may serve as reasonable solutions in practical applications
  • 3
    • 0041675181 scopus 로고    scopus 로고
    • Special issue of Art. Int. 81 (1996)
    • (1996) Art. Int. , vol.81 , Issue.SPEC. ISSUE
  • 4
    • 0042175892 scopus 로고    scopus 로고
    • Special issue of Theor. Comp. Sci. 265 (2001)
    • (2001) Theor. Comp. Sci. , vol.265 , Issue.SPEC. ISSUE
  • 19
    • 0042677088 scopus 로고    scopus 로고
    • note
    • (k) (i) is almost allways a tree, and the above argument works with probability one (for N → ∞)


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