@inproceedings{Kranakis2001ApproximateHA,
author={Evangelos Kranakis and Danny Krizanc and Sunil M. Shende},
booktitle={ISAAC},
year={2001}
}
• Published in ISAAC 19 December 2001
• Computer Science, Mathematics
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…
31 Citations
• Computer Science
Algorithmica
• 2007
This work gives the first linear time algorithm for assigning hotlinks so that the number of steps to access a page i from the root of the tree reaches the entropy bound, i.e. is at most O(log (W/wi) where W=∑i∈Twi.
• Computer Science, Mathematics
Algorithmica
• 2008
The first efficient general methods for assigning at most k hotlinks per node in trees of arbitrary maximum degree, achieving bounds on l of at most $\frac{2H(p)}{\log(k+1)}+1$ and Â£1\$ , respectively.
Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search
• Computer Science
ISAAC
• 2004
This paper addresses 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 and presents a (14/3)-approximate algorithm that runs in a O(n log m) time and requires a linear space.
Improved Approximations for the Hotlink Assignment Problem and Binary Searching on Trees
• Computer Science, Mathematics
• 2007
A linear time algorithm is developed that provides the first constant approximation for the average case version of the problem of binary searching in trees, a natural generalization of the classical problem of searching in lists with different access probabilities.
Improved approximations for the hotlink assignment problem
• Computer Science, Mathematics
TALG
• 2011
A 16-approximation algorithm for the most general version of the problem where up to k hotlinks can be assigned from each node and it turns to be the first algorithm with constant approximation for this problem.
Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract)
• Computer Science
ISAAC
• 2003
The paper proposes a hotlinks structure allowing a user with limited a-priori knowledge to determine which hotlink to use at every given point, and presents a polynomial algorithm for solving the hotlink enhancement problem for such hotlinks on trees of logarithmic depth.
On the Complexity of Optimal Hotlink Assignment
It is proved that this optimization problem is NP-hard, even if only one outgoing hotlink is allowed for each node, and it is demonstrated that for this model optimal solutions can be computed in O(n2) time.
Constant factor approximations for the hotlink assignment problem
The natural greedy strategy is analyzed, proving that it reaches the optimal gain up to the constant factor of 2, and a polynomial-time 2-approximation is given for the 1-hotlink assignment problem, which constitutes the first constant factor approximation in terms of the path length.
Enhancing Hyperlink Structure for Improving Web Performance
• Computer Science
J. Web Eng.
• 2003
The Hotlink Optimizer (HotOpt), a new software tool that finds an assignment of hotlinks reducing the access cost of a Web site by adding hotlinks over its underlying structure is developed.

## References

SHOWING 1-10 OF 21 REFERENCES
• Computer Science, Mathematics
ISAAC
• 2000
This work gives algorithms for assigning hotlinks, as well as upper and lower bounds on the expected number of steps to reach the leaves from the source page s located at the root of a complete binary tree.
Hotlink Enhancement Algorithms for Web Directories: (Extended Abstract)
• Computer Science
ISAAC
• 2003
The paper proposes a hotlinks structure allowing a user with limited a-priori knowledge to determine which hotlink to use at every given point, and presents a polynomial algorithm for solving the hotlink enhancement problem for such hotlinks on trees of logarithmic depth.
Enhancing Hyperlink Structure for Improving Web Performance
• Computer Science
J. Web Eng.
• 2003
The Hotlink Optimizer (HotOpt), a new software tool that finds an assignment of hotlinks reducing the access cost of a Web site by adding hotlinks over its underlying structure is developed.
• Computer Science
WG
• 2001
The input for the hotlink assignment problem consists of a node weighted directed acyclic graph with a designated root node r. The goal is to minimize the weighted shortest path length rooted at r by
Approximation Algorithm for Hotlink Assignments in Web Directories
• Computer Science