### Abstract

Consider a DAG (directed acyclic graph) G = (V;E) re- presenting a collection V of web pages connected via links E. All web pages can be reached from a designated source page, represented by a source node s of G. Each web page carries a weight representative of the frequency with which it is visited. By adding hotlinks, at most one per page, we are interested in minimizing the expected number of steps needed to visit a selected set of web pages from the source page. For arbitrary DAGs we show that the problem is NP-complete. We also give 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. Depending on the probability distribution (arbitrary, uniform, Zipf) the expected number of steps is at most c n, where c is a constant less than 1. For the geometric distribution we show how to obtain a constant average number of steps.

Original language | English (US) |
---|---|

Title of host publication | Algorithms and Computation - 11th International Conference, ISAAC 2000, Proceedings |

Editors | D.T. Lee, Shang-Hua Teng, Shang-Hua Teng |

Publisher | Springer Verlag |

Pages | 23-34 |

Number of pages | 12 |

ISBN (Print) | 3540412557, 9783540412557 |

State | Published - Jan 1 2000 |

Externally published | Yes |

Event | 11th Annual International Symposium on Algorithms and Computation, ISAAC 2000 - Taipei, Taiwan, Province of China Duration: Dec 18 2000 → Dec 20 2000 |

### Publication series

Name | Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) |
---|---|

Volume | 1969 |

ISSN (Print) | 0302-9743 |

ISSN (Electronic) | 1611-3349 |

### Conference

Conference | 11th Annual International Symposium on Algorithms and Computation, ISAAC 2000 |
---|---|

Country | Taiwan, Province of China |

City | Taipei |

Period | 12/18/00 → 12/20/00 |

### ASJC Scopus subject areas

- Theoretical Computer Science
- Computer Science(all)

## Fingerprint Dive into the research topics of 'Strategies for hotlink assignments'. Together they form a unique fingerprint.

## Cite this

*Algorithms and Computation - 11th International Conference, ISAAC 2000, Proceedings*(pp. 23-34). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 1969). Springer Verlag.