Towards adaptive Web sites: conceptual framework and case study
Artificial Intelligence - Special issue on Intelligent internet systems
IEEE/ACM Transactions on Networking (TON)
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
Optimal Placement of Web Proxies for Tree Networks
EEE '04 Proceedings of the 2004 IEEE International Conference on e-Technology, e-Commerce and e-Service (EEE'04)
Approximate hotlink assignment
Information Processing Letters
Near-entropy hotlink assignments
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Reducing human interactions in Web directory searches
ACM Transactions on Information Systems (TOIS)
Approximation algorithm for hotlink assignment in the greedy model
Theoretical Computer Science
On the Complexity of Optimal Hotlink Assignment
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
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
Optimal approximability of bookmark assignments
Discrete Applied Mathematics
| Hi-index | 0.00 |
The concept of hotlink assignment aims at reducing the navigation effort for the users of a Web directory or similar structure by inserting a limited number of additional hyperlinks called hotlinks. The k-hotlink assignment problem denotes the task of adding at most k outgoing hotlinks to each page of a tree-like site, minimizing the path length, that is, the expected number of “clicks” necessary for the user to reach her destination page. Another common formulation of this problem is to maximize the gain, that is, 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 for the 1-hotlink assignment problem, 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.