Approximate Hotlink Assignment

@inproceedings{Kranakis2001ApproximateHA,
  title={Approximate Hotlink Assignment},
  author={Evangelos Kranakis and Danny Krizanc and Sunil M. Shende},
  booktitle={ISAAC},
  year={2001}
}
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… 
Dynamic Hotlinks
TLDR
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.
Near-Entropy Hotlink Assignments
TLDR
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
TLDR
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
TLDR
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
TLDR
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)
TLDR
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
TLDR
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.
Approximation algorithm for hotlink assignment in the greedy model
Constant factor approximations for the hotlink assignment problem
TLDR
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
TLDR
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
Strategies for Hotlink Assignments
TLDR
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)
TLDR
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
TLDR
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.
Multiple Hotlink Assignment
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
TLDR
An approximation algorithm for the addition of shortcut links to information structures based on linked nodes such as the web with approximation ratio 2.5 is introduced.
Towards Adaptive Web Sites: Conceptual Framework and Case Study
Using Web server logs to improve site design
TLDR
Server logs can be used to monitor use patterns and employ them to improve the design and functionality of the web site, as well as analyze and redesign a wide range of webbased material.
Asymmetric Communication Protocols via Hotlink Assignments
TLDR
A new asymmetric communication protocol with different performance bounds than previous protocols is presented, by generalizing previous results on the hotlink problem and exploiting this relationship between Adler and Maggs and Bose et al.
The art of computer programming: sorting and searching (volume 3)
Apparatus for supporting different nets for various sporting purposes including interengaging tubular rods which are arranged to interconnect and have ground engaging portions suitable to be useful
Information Theory and Coding
TLDR
One that the authors will refer to break the boredom in reading is choosing information theory and coding as the reading material.
...
...