메뉴 건너뛰기




Volumn 3341, Issue , 2004, Pages 778-792

Efficient algorithms for the hotlink assignment problem: The worst case search

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; DYNAMIC PROGRAMMING; HYPERTEXT SYSTEMS; POLYNOMIAL APPROXIMATION; TREES (MATHEMATICS); DECISION TREES; FORESTRY; WEBSITES;

EID: 26844556519     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-30551-4_67     Document Type: Article
Times cited : (15)

References (9)
  • 2
    • 0033295256 scopus 로고    scopus 로고
    • Towards adaptive Web sites: Conceptual framework and case study
    • Amsterdam, Netherlands: 1999
    • Perkowitz, M., Etzioni, O.: Towards adaptive Web sites: conceptual framework and case study. Computer Networks (Amsterdam, Netherlands: 1999) 31 (1999) 1245-1258
    • (1999) Computer Networks , vol.31 , pp. 1245-1258
    • Perkowitz, M.1    Etzioni, O.2
  • 8
    • 35048835803 scopus 로고    scopus 로고
    • Efficient implementation of hotlink assignment algorithms for web sites
    • Pessoa, A., Laber, E., Souza, C.: Efficient implementation of hotlink assignment algorithms for web sites. In: Proceedings of ALENEX. (2004)
    • (2004) Proceedings of ALENEX
    • Pessoa, A.1    Laber, E.2    Souza, C.3


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