Approximation Algorithm for Hotlink Assignments in Web Directories

  • Rachel Matichin
  • David Peleg
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2748)


Hotlink assignment concerns the addition of shortcut links to information structures based on linked nodes such as the web. Each node in the structure is associated with a weight representing the frequency that node is accessed by users. To access a node, the user must follow the path leading to it from the root. Introducing additional edges (hotlinks) to the structure may reduce its access cost, taken to be the expected number of steps needed to reach a node from the root. The hotlink assignment problem is to find a set of hotlinks achieving the greatest improvement in the access cost. This paper introduces an approximation algorithm for this problem with approximation ratio 2.


Approximation Algorithm Greedy Algorithm Approximation Ratio Access Cost Access Probability 
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.
    Bose, P., Czywizowicz, J., Gasieniec, L., Kranakis, E., Krizanc, D., Pelc, A., Martin, M.V.: Strategies for hotlink assignments. In: Lee, D.T., Teng, S.-H. (eds.) ISAAC 2000. LNCS, vol. 1969, pp. 23–34. Springer, Heidelberg (2000)CrossRefGoogle Scholar
  2. 2.
    Kranakis, E., Krizanc, D., Shende, S.: Approximating hotlink assignments. In: ISAAC 2009, pp. 756–767Google Scholar
  3. 3.
    Gerstel, O., Kutten, S., Matichin, R., Peleg, D.: Hotlink Enhancement Algorithms for Web Directories (unpublished manuscript) Google Scholar
  4. 4.
    Bose, P., Krizanc, D., Langerman, S., Morin, P.: Asymmetric communication protocols via hotlink assignments. In: Proc. 9th Colloq. on Structural Information and Communication Complexity, pp. 33–39 (June 2002)Google Scholar
  5. 5.
  6. 6.

Copyright information

© Springer-Verlag Berlin Heidelberg 2003

Authors and Affiliations

  • Rachel Matichin
    • 1
  • David Peleg
    • 1
  1. 1.The Weizmann Institute of ScienceRehovotIsrael

Personalised recommendations