Summary of WWW characterizations
World Wide Web
Strategies for Hotlink Assignments
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
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
Constant factor approximations for the hotlink assignment problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Optimal approximability of bookmark assignments
Discrete Applied Mathematics
| Hi-index | 0.00 |
The concept of hotlink assignment aims at enhancing the structure of Web sites such that the user's expected navigation effort is minimized. We concentrate on sites that are representable by trees and assume that each leaf carries a weight representing its popularity. The problem of optimally adding at most one additional outgoing edge (“hotlink”) to each inner node has been widely studied. A considerable number of approximation algorithms have been proposed and worst-case bounds for the quality of the computed solutions have been given. However, only little is known about the practical behavior of most of these algorithms. This article contributes to closing this gap by evaluating all recently proposed strategies experimentally. Our experiments are based on trees extracted from real Web sites, as well as on synthetic instances. The latter are generated by a new method that simulates the growth of a Web site over time. Finally, we present a new heuristic that is easy to implement and exhibits excellent behavior in practice.