Hotlink Assignment on the Web

  • E. S. Laber
Part of the Lecture Notes in Computer Science book series (LNCS, volume 4123)


Here, we explain the problem of assigning hotlinks to web pages. We indicate the known results for this problem and the open questions.


Source Node Polynomial Time Algorithm Constant Factor Approximation Feasible Assignment Constant Approximation Ratio 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Abramson, N.: Information Theory and Coding. McGraw Hill, New York (1963)Google Scholar
  2. 2.
    Bose, P., Kranakis, E., Krizanc, D., Martin, M.V., Czyzowicz, J., Pelc, A., Gasieniec, L.: Strategies for hotlink assignments. In: International Symposium on Algorithms and Computation, pp. 23–34 (2000)Google Scholar
  3. 3.
    Drott, M.C.: Using web server logs to improve site design. In: Proceedings of ACM Conference of Computer Documentation, pp. 43–50 (1998)Google Scholar
  4. 4.
    Fuhrmann, S., Krumke, S.O., Wirth, H.-C.: Multiple hotlink assignment. In: Proceedings of the Twenty-Seventh International Workshop on Graph- Theoretic Concepts in Computer Science (2001)Google Scholar
  5. 5.
    Kranakis, E., Krizanc, D., Shende, S.: Approximate hotlink assignment. In: Eades, P., Takaoka, T. (eds.) ISAAC 2001. LNCS, vol. 2223, pp. 756–767. Springer, Heidelberg (2001)CrossRefGoogle Scholar
  6. 6.
    Martin, M.V.: Enhancing hyperlink structure for improving web performance, PhD. Thesis, Carleton University (2002)Google Scholar
  7. 7.
    Perkowitz, M., Etzioni, O.: Towards adaptive web sites: conceptual framework and case study. Computer Networks 31(11–16), 1245–1258 (1999)CrossRefGoogle Scholar
  8. 8.
    Pessoa, A.A., Laber, E.S., Souza, C.: On the worst case search in trees with hotlinks, Technical Report MCC 23/03, Departmento de Informatica, PUC-Rio (2003)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2006

Authors and Affiliations

  • E. S. Laber

There are no affiliations available

Personalised recommendations