An experimental study of recent hotlink assignment algorithms

Proceedings of the 10th Workshop on Algorithm Engineering and Experiments and the 5th Workshop on Analytic Algorithmics and Combinatorics

Volumn , Issue , 2008, Pages 142-151

  Jacobs, Tobias ^a  

^a UNIVERSITY OF FREIBURG   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; FORESTRY;

ASSIGNMENT ALGORITHMS; HOTLINKS; HOTLINKS ASSIGNMENTS; MEMORY EFFICIENT; OPTIMAL SOLUTIONS; WEB-SITES;

WEBSITES;

EID: 58349083482     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1137/1.9781611972887.14     Document Type: Conference Paper

References (14)

1. A.-L. Barabasi and R. Albert. Emergence of scaling in random networks. Science, 286:509, 1999.
2. P. Bose, E. Kranakis, D. Krizanc, M. V. Martin, J. Czyzowicz, A. Pelc, and L. Gasieniec. Strategies for hotlink assignments. In International Symposium on Algorithms and Computation, pages 23-34, 2000.
3. J. Czyzowicz, E. Kranakis, D. Krizanc, A. Pelc, and M. Martin. Evaluation of hotlink assignment heuristics for improving web access.
4. J. Czyzowicz, E. Kranakis, D. Krizanc, A. Pelc, and M. V. Martin. Enhancing hyperlink structure for improving web performance. J. Web Eng., 1(2):93-127, 2003.
5. K. Douïeb and S. Langerman. Dynamic hotlinks. In F. K. H. A. Dehne, A. López-Ortiz, and J.-R. Sack, editors, WADS, volume 3608 of Lecture Notes in Computer Science, pages 182-194. Springer, 2005.
6. K. Douïeb and S. Langerman. Near-entropy hotlink assignments. In Proceedings of the 14th Annual European Symposium on Algorithms (ESA 2006), volume 4168 of LNCS, pages 292-303, Zürich, Switzerland, 2006. Springer Berlin / Heidelberg.
7. O. O. Gerstel, S. Kutten, R. Matichin, and D. Peleg. Hotlink enhancement algorithms for web directories: (extended abstract). In T. Ibaraki, N. Katoh, and H. Ono, editors, ISAAC, volume 2906 of Lecture Notes in Computer Science, pages 68-77. Springer, 2003.
8. M. L. Goldstein, S. A. Morris, and G. G. Yen. Problems with fitting to the power-law distribution. The European Physical Journal B - Condensed Matter and Complex Systems, 41(2):255-258, 2004.
9. T. Jacobs. Constant factor approximations for the hotlink assignment problem. In Proceedings of the 10th Workshop on Algorithms and Data Structures (WADS 2007), Halifax, Canada, 2007.
10. E. Kranakis, D. Krizanc, and S. Shende. Approximate hotlink assignment. Inf. Process. Lett., 90(3):121-128, 2004.
11. R. Matichin and D. Peleg. Approximation algorithm for hotlink assignment in the greedy model. Theor. Comput. Sci., 383(1):102-110, 2007.
12. A. A. Pessoa, E. S. Laber, and C. de Souza. Efficient algorithms for the hotlink assignment problem: The worst case search. In R. Fleischer and G. Trippen, editors, ISAAC, volume 3341 of Lecture Notes in Computer Science, pages 778-792. Springer, 2004.
13. A. A. Pessoa, E. S. Laber, and C. de Souza. Efficient implementation of hotlink assignment algorithm for web sites. In L. Arge, G. F. Italiano, and R. Sedgewick, editors, ALENEX/ANALC, pages 79-87. SIAM, 2004.
14. J. E. Pitkow. Summary of www characterizations. World Wide Web, 2(1-2):3-13, 1999.