Hotlink enhancement algorithms for web directories (extended abstract)

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2906, Issue , 2003, Pages 68-77

  Gerstel, Ori ^a   Kutten, Shay ^b   Matichin, Rachel ^c   Peleg, David ^c  

^a IBM T J WATSON RESEARCH CENTER   (United States)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; BINARY TREES; SOCIAL NETWORKING (ONLINE); WEBSITES;

ACCESS COST; ARBITRARY DEGREE; ENHANCEMENT ALGORITHMS; INDEX TREES; POLYNOMIAL ALGORITHM; PRIORI KNOWLEDGE; UPPER BOUND; WEB DIRECTORIES;

TREES (MATHEMATICS);

EID: 35248848868     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24587-2_9     Document Type: Article

References (8)

1. http://www.google.com/.
2. Bose, P., Czywizowicz, J., Gasieniec, L., Kranakis, E., Krizanc, D., Pelc, A., and Martin, M. V., Strategies for hotlink assignments. Proc. 11th Symp. on algorithms and computation (ISAAC 2000), pp. 23-34.
3. Kranakis, E., Krizanc, D., and Shende, S., Approximating hotlink assignments, Proc. 12th Symp. on algorithms and computation (ISSAC 2001), pp. 756-767.
4. Bose, P., Krizanc, D., Langerman, S. and Morin, P., Asymmetric communication protocols via hotlink assignments, Proc. 9th Colloq. on Structural Information and Communication Complexity, June 2002, pp. 33-39.
5. Matichin, R., and Peleg, D., Approximation Algorithm for Hotlink Assignments in Web Directories, 8th Workshop on Algorithms and Data Structures, Ottawa, Canada, Aug. 2003.
6. http://www.yahoo.com/.
7. www.dmoz.org
8. Attardi G., Di Marco S., Salvi D, Categorization by Context, Journal of Universal Computer Science, (1998), Springer Verlag. 4:9:719-736.