Abstract
Link-based information structures such as the web can be enhanced through the addition of hotlinks. Assume that each node in the information structure is associated with a weight representing the access frequency of the node by users. In order to access a particular node, the user has to follow a path leading to it from the root node. By adding new hotlinks to the tree, it may be possible to reduce the access cost of the system, namely, the expected number of steps needed to reach a leaf from the root, assuming the user can decide which hotlinks to follow in each step. The hotlink assignment problem involves finding a set of hotlinks maximizing the gain in the expected cost. The paper addresses this problem in the more realistic greedy user model recently introduced in [3], and presents a polynomial time 2-approximation algorithm for the hotlink assignment problem on trees.
Original language | English |
---|---|
Title of host publication | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
Editors | Rastislav Kralovic, Ondrej Sykora |
Publisher | Springer Verlag |
Pages | 233-244 |
Number of pages | 12 |
ISBN (Print) | 3540222308 |
DOIs | |
State | Published - 2004 |
Externally published | Yes |
Publication series
Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|
Volume | 3104 |
ISSN (Print) | 0302-9743 |
ISSN (Electronic) | 1611-3349 |
Bibliographical note
Funding Information:The second author’s research was supported in part by a grant from the Israel Science Foundation.
Funding
The second author’s research was supported in part by a grant from the Israel Science Foundation.
Funders | Funder number |
---|---|
Israel Science Foundation |