The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Using Web server logs to improve site design
Proceedings of the 16th annual international conference on Computer documentation
Towards adaptive Web sites: conceptual framework and case study
WWW '99 Proceedings of the eighth international conference on World Wide Web
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
Enhancing hyperlink structure for improving web performance
Journal of Web Engineering
Reducing human interactions in Web directory searches
ACM Transactions on Information Systems (TOIS)
Quicklink selection for navigational query results
Proceedings of the 18th international conference on World wide web
An experimental study of recent hotlink assignment algorithms
Journal of Experimental Algorithmics (JEA)
An optimization framework for query recommendation
Proceedings of the third ACM international conference on Web search and data mining
Designing self-adaptive websites using online hotlink assignment algorithm
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Constant factor approximations for the hotlink assignment problem
ACM Transactions on Algorithms (TALG)
Hi-index | 0.89 |
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(N2) 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 H(p) / (log (d + 1 ) - (d/(d + 1)) log d) + (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 H(p)/log(d + 1). We also show how to adapt our algorithm to complete trees of a given degree d and in this case we prove it is optimal, asymptotically in d.