Towards adaptive Web sites: conceptual framework and case study
WWW '99 Proceedings of the eighth international conference on World Wide Web
Strategies for Hotlink Assignments
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
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
Enhancing hyperlink structure for improving web performance
Journal of Web Engineering
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)
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
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)
Improved approximations for the hotlink assignment problem
ACM Transactions on Algorithms (TALG)
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
On approximation of bookmark assignments
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
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 |
Let T be a rooted directed tree where nodes represent web pages of a web site and arcs represent hyperlinks In this case, when a user searches for an information i, it traverses a directed path in T, from the root node to the node that contains i In this context, hotlinks are defined as additional hyperlinks added to web pages in order to reduce the number of accessed pages per search In this paper, we address the problem of inserting at most 1 hotlink in each web page, so as to minimize the number of accesses in a worst case search We present a (14/3)-approximate algorithm that runs in a O(n log m) time and requires a linear space, where n and m are the number of nodes (internal and external) and the number of leaves in T, respectively We also introduce an exact dynamic programming algorithm which runs in O(n(nm)2.284) time and uses O(n(nm)1.441) space By extending the techniques presented here, a polynomial time algorithm can also be obtained when ${\mathcal K}=O(1)$ hotlinks may be inserted in each page The best known result for this problem is a polytime algorithm with constant approximation ratio for trees with bounded degree presented by Gerstel et al [1].