Near-entropy hotlink assignments
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
On the Complexity of Optimal Hotlink Assignment
ESA '08 Proceedings of the 16th annual European symposium on Algorithms
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
Generalized link suggestions via web site clustering
Proceedings of the 20th international conference on World wide web
Improved approximations for the hotlink assignment problem
ACM Transactions on Algorithms (TALG)
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
General Theory of Information Transfer and Combinatorics
Constant factor approximations for the hotlink assignment problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
| Hi-index | 0.00 |
Consider a directed rooted tree T = (V,E) of maximal degree d representing a collection V of web pages connected via a set E of links all reachable from a source home page, represented by the root of T. Each leaf web page carries a weight representative of the frequency with which it is visited. By adding hotlinks, shortcuts from a node to one of its descendents, we are interested in minimizing the expected number of steps needed to visit the leaf pages from the home page. We give an O(N 2) time algorithm for assigning hotlinks so that the expected number of steps to reach the leaves from the root of the tree is at most $$\tfrac{{H\left( p \right)}}{{log\left( {d + 1} \right) - \left( {d/\left( {d + 1} \right)} \right)log d}} + \tfrac{{d + 1}}{d}$$, where H(p) is the entropy of the probability (frequency) distribution p =p1,p2, , . . . , pN on the N leaves of the given tree, i.e., pi is the weight on the ith leaf. The best known lower bound for this problem is $$\tfrac{{H\left( p \right)}}{{log\left( {d + 1} \right)}}$$. Thus our algorithm approximates the optimal hotlink assignment to within a constant for any fixed d.