Approximation algorithm for hotlink assignment in the greedy model

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

Volumn 3104, Issue , 2004, Pages 233-244

  Matichin, Rachel ^a   Peleg, David ^a  

^a WEIZMANN INSTITUTE OF SCIENCE   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; APPROXIMATION ALGORITHMS; COMBINATORIAL OPTIMIZATION; FORESTRY; POLYNOMIAL APPROXIMATION;

ACCESS COST; ACCESS FREQUENCY; ASSIGNMENT PROBLEMS; EXPECTED COSTS; INFORMATION STRUCTURES; LINK-BASED; POLYNOMIAL-TIME; USER MODELING;

TREES (MATHEMATICS);

EID: 35048825787     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27796-5_21     Document Type: Article

References (7)

1. P. Bose, J. Czyzowiez, L. Gasieniec, E. Kranakis, D. Krizanc, A. Pelc and M.V. Martin, Strategies for hotlink assignments, In -Proc. 11th Symp. on Algorithms and Computation, 2000, pp. 23-34.
2. E. Kranakis, D. Krizanc and S. Shende, Approximating hotlink assignments, In . Proc. 12th Symp. on Algorithms and Computation, 2001, pp. 756-767.
3. O. Gerstel, S. Kutten, R. Matichin and D. Peleg, Hotlink enhancement algorithms for web directories, In Proc. 14th Symp. on Algorithms and Computation, 2003, pp. 68-77.
4. R. Matichin and D. Peleg, Approximation algorithm for hotlink assignments in web directories, In Proc. Workshop on Algorithms and Data Structures, 2003, pp. 271-280.
5. P. Bose, D. Krizanc, S. Langerman and P. Morin, Asymmetric communication protocols via hotlink assignments, In Proc. 9th Colloq. on Structural Information and Communication Complexity, 2002, pp. 33-39.
6. http://www.yahoo.com/
7. http://www.dmoz.org/