Towards adaptive Web sites: conceptual framework and case study
WWW '99 Proceedings of the eighth international conference on World Wide Web
Strategies for Hotlink Assignments
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Near-entropy hotlink assignments
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Approximate Hotlink Assignment
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Enhancing hyperlink structure for improving web performance
Journal of Web Engineering
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Efficient algorithms for the hotlink assignment problem: the worst case search
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
On the Complexity of Optimal Hotlink Assignment
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
Resource Management in Large Networks
Algorithmics of Large and Complex Networks
An experimental study of recent hotlink assignment algorithms
Journal of Experimental Algorithmics (JEA)
Context-similarity based hotlinks assignment: Model, metrics and algorithm
Data & Knowledge Engineering
Designing self-adaptive websites using online hotlink assignment algorithm
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Improved approximations for the hotlink assignment problem
ACM Transactions on Algorithms (TALG)
| Hi-index | 0.00 |
An approach for reducing the navigation effort for the users of a web site is to enhance its hyperlink structure with additional hotlinks. We address the task of adding at most one such additional outgoing edge to each page of a tree-like site, minimizing the path length, i.e. the expected number of "clicks" necessary for the user to reach his destination page. Another common formulation of that problem is to maximize the gain, i.e. the path length reduction achieved by the assignment. In this work we analyze the natural greedy strategy, proving that it reaches the optimal gain up to the constant factor of 2. Considering the gain, we also prove the existence of a PTAS. Finally, we give a polynomial time 2-approximation which constitutes the first constant factor approximation in terms of the path length. The algorithms' performance analyses are made possible by a set of three new basic operations for the transformation of hotlink assignments.