A data structure for dynamic trees
Journal of Computer and System Sciences
Towards adaptive Web sites: conceptual framework and case study
WWW '99 Proceedings of the eighth international conference on World Wide Web
Skip Lists: A Probabilistic Alternative to Balanced Trees
WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
Strategies for Hotlink Assignments
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Randomized Jumplists: A Jump-and-Walk Dictionary Data Structure
STACS '03 Proceedings of the 20th Annual Symposium on Theoretical Aspects of Computer Science
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
Nordic Journal of Computing
Approximate Hotlink Assignment
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
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
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
Constant factor approximations for the hotlink assignment problem
ACM Transactions on Algorithms (TALG)
Improved approximations for the hotlink assignment problem
ACM Transactions on Algorithms (TALG)
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 rooted tree T of arbitrary maximum degree d representing a collection of n web pages connected via a set of links, all reachable from a source home page represented by the root of T. Each web page i carries a weight wi representative of the frequency with which it is visited. By adding hotlinks - shortcuts from a node to one of its descendents - we wish to minimize the expected number of steps / needed to visit pages from the home page, expressed as a function of the entropy H(p) of the access probabilities p. This paper introduces several new strategies for effectively assigning hotlinks in a tree. For assigning exactly one hotlink per node, our method guarantees an upper bound on / of 1.141 H(p)+1 if d2 and 1.08 H (p) + 2/3 if d=2. We also present the first efficient general methods for assigning at most k hotlinks per node in trees of arbitrary maximum degree, achieving bounds on / of at most 2H(p)/log(k+1) and H(p)/log(k+d-logd, respectively. Finally, we present an algorithm implementing these methods in O(n logn) time, an improvement over the previous O(n2) time algorithms.