Approximation algorithm for hotlink assignments in web directories

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

Volumn 2748, Issue , 2003, Pages 271-280

  Matichin, Rachel ^a   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMBINATORIAL OPTIMIZATION;

ACCESS COST; APPROXIMATION RATIOS; ASSIGNMENT PROBLEMS; HOTLINKS; INFORMATION STRUCTURES; SHORTCUT LINK; WEB DIRECTORIES;

APPROXIMATION ALGORITHMS;

EID: 35248816472     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45078-8_24     Document Type: Article

References (6)

1. 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.
2. Kranakis, E., Krizanc, D., and Shende, S., Approximating hotlink assignments, Proc. 12th Symp. on algorithms and computation (ISSAC 2001), pp. 756-767.
3. Gerstel, O., Kutten, S., Matichin, R., Peleg, D., Hotlink Enhancement Algorithms for Web Directories, Unpublished manuscript.
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. http://www.yahoo.com/.
6. http://www.dmoz.org/.