A data structure for dynamic trees
Journal of Computer and System Sciences
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
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Fast Updating of Well-Balanced Trees
SWAT '90 Proceedings of the 2nd Scandinavian Workshop on Algorithm Theory
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
Approximate Hotlink Assignment
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Efficient algorithms for the hotlink assignment problem: the worst case search
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
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
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 directed rooted tree T=(V,E) representing a collection V of n web pages connected via a set E 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 are interested in minimizing the expected number of steps needed to visit pages from the home page. We give the first linear time algorithm for assigning hotlinks so that the number of steps to accede to a page i from the root of the tree reaches the entropy bound, i.e. is at most $O({\rm log} \frac{W}{w_i})$ where W=∑i∈Twi. The best previously known algorithm for this task runs in time O(n2). We also give the first efficient data structure for maintaining hotlinks when nodes are added, deleted or their weights modified, in amortized time $O({\rm log} \frac{W}{w_i})$ per update. The data structure can be made adaptative, i.e. reaches the entropy bound in the amortized sense without knowing the weights wi in advance.