Skip to main content
SpringerLink
Log in

On the Complexity of Optimal Hotlink Assignment

  • Published:
Algorithmica Aims and scope Submit manuscript

Abstract

The concept of hotlink assignment aims at reducing the navigation effort for users of a web directory or similar structure by inserting a limited number of additional hyperlinks called hotlinks. Given an access probability distribution of the leaves of the tree representing the web site, the goal of hotlink assignment algorithms is to minimize the expected path length between the root and the leaves.

We prove that this optimization problem is NP-hard, even if only one outgoing hotlink is allowed for each node. This answers a question that has been open since the first formulation of the problem in Bose et al. (Proceedings of 11th International Symposium on Algorithms and Computation (ISAAC), 2000) nine years ago.

In this work we also investigate the model where hotlinks are only allowed to point at the leaves of the tree. We demonstrate that for this model optimal solutions can be computed in O(n 2) time. Our algorithm L-OPT also operates in a more general setting, where the maximum number of outgoing hotlinks is specified individually for each node. The runtime is then O(n 3). Experimental evaluation shows that L-OPT terminates within less than one second on problem instances having up to half a million nodes.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Bose, P., Czyzowicz, J., Gasienicz, L., Kranakis, E., Krizanc, D., Pelc, A., Vargas Martin, M.: Strategies for hotlink assignments. In: Proceedings of 11th International Symposium on Algorithms and Computation (ISAAC) (2000)

    Google Scholar 

  2. Bose, P., Krizanc, D., Langerman, S., Morin, P.: Asymmetric communication protocols via hotlink assignments. In: Proceeding of the 9th Colloquium on Structural Information and Communication Complexity (SIROCCO) (2002)

    Google Scholar 

  3. Czyzowicz, J., Kranakis, E., Krizanc, D., Pelc, A., Vargas Martin, M.: Evaluation of hotlink assignment heuristics for improving web access. In: Proceedings of the 2nd International Conference on Internet Computing (ICOMP) (2001)

    Google Scholar 

  4. Czyzowicz, J., Kranakis, E., Krizanc, D., Pelc, A., Vargas Martin, M.: Enhancing hyperlink structure for improving web performance. J. Web Eng. 1(2), 93–127 (2003)

    Google Scholar 

  5. Douïeb, K., Langerman, S.: Near-entropy hotlink assignments. In: Proceedings of the 14th Annual European Symposium on Algorithms (ESA) (2006)

    Google Scholar 

  6. Douïeb, K., Langerman, S.: Dynamic hotlinks. Algorithmica 50(2) 208–222 (2008)

    Article  MATH  MathSciNet  Google Scholar 

  7. Fuhrmann, S., Krumke, S., Wirth, H.: Multiple hotlink assignment. In: Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science (WG) (2001)

    Google Scholar 

  8. Gerstel, O., Kutten, S., Laber, E., Matichin, R., Peleg, D., Pessoa, A., Souza, C.: Reducing human interactions in web directory searches. ACM Trans. Inf. Syst. 25(4) 20 (2007)

    Article  Google Scholar 

  9. Jacobs, T.: Constant factor approximations for the hotlink assignment problem. In: Proceedings of the 10th Workshop on Algorithms and Data Structures (WADS) (2007)

    Google Scholar 

  10. Jacobs, T.: An experimental study of recent hotlink assignment algorithms. In: Proceedings of the Workshop on Algorithm Engineering and Experiments (ALENEX) and the First Workshop on Analytic Algorithmics and Combinatorics (ANALCO) (2008)

    Google Scholar 

  11. Karp, R.M.: Reducibility among combinatorial problems. In: Complexity of Computer Computations, pp. 85–103. Plenum, New York (1972)

    Google Scholar 

  12. Kranakis, E., Krizanc, D., Shende, S.: Approximate hotlink assignment. Inf. Process. Lett. 90(3) 121–128 (2004)

    Article  MATH  MathSciNet  Google Scholar 

  13. Laber, E., Molinaro, M.: Improved approximations for the hotlink assignment problem. ACM Trans. Algorithms, to appear

  14. Li, K., Shen, H.: Optimal placement of web proxies for tree networks. In: IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE’04) (2004)

    Google Scholar 

  15. Matichin, R., Peleg, D.: Approximation algorithm for hotlink assignments in web directories. In: Proceedings of 8th the Workshop of Algorithm Theory (WADS) (2003)

    Google Scholar 

  16. Matichin, R., Peleg, D.: Approximation algorithm for hotlink assignment in the greedy model. Theor. Comput. Sci. 383(1) 102–110 (2004)

    Article  MathSciNet  Google Scholar 

  17. Papadimitriou, C., Steiglitz, K.: In: Combinatorial Optimization: Algorithms and Complexity, pp. 248–255. Dover, New York (1982)

    Google Scholar 

  18. Perkowitz, M., Etzioni, O.: Towards adaptive web sites: conceptual framework and case study. Comput. Netw. 31(11–16), 1245–1258 (1999)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of Freiburg, Georges-Köhler-Allee 79, 79110, Freiburg, Germany

    Tobias Jacobs

Authors
  1. Tobias Jacobs
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Tobias Jacobs.

Additional information

An extended abstract of this work has been accepted for publication in Proceedings of the 15th Annual European Symposium on Algorithms (ESA), 2008.

Work supported by the Deutsche Forschungsgemeinschaft, project AL 464/5-1.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Jacobs, T. On the Complexity of Optimal Hotlink Assignment. Algorithmica 62, 982–1005 (2012). https://doi.org/10.1007/s00453-011-9495-4

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00453-011-9495-4

Keywords

Search

Navigation