Get 20M+ Full-Text Papers For Less Than $1.50/day. Start a 14-Day Trial for You or Your Team.

Learn More →

Constant factor approximations for the hotlink assignment problem

Constant factor approximations for the hotlink assignment problem Constant Factor Approximations for the Hotlink Assignment Problem TOBIAS JACOBS, University of Freiburg The concept of hotlink assignment aims at reducing the navigation effort for the users of a Web directory or similar structure by inserting a limited number of additional hyperlinks called hotlinks. The k-hotlink assignment problem denotes the task of adding at most k outgoing hotlinks to each page of a tree-like site, minimizing the path length, that is, the expected number of œclicks  necessary for the user to reach her destination page. Another common formulation of this problem is to maximize the gain, that is, the path length reduction achieved by the assignment. In this work we analyze the natural greedy strategy, proving that it reaches the optimal gain up to the constant factor of 2. Considering the gain, we also prove the existence of a PTAS. Finally, we give a polynomial-time 2-approximation for the 1-hotlink assignment problem, which constitutes the rst constant factor approximation in terms of the path length. The algorithms ™ performance analyses are made possible by a set of three new basic operations for the transformation of hotlink assignments. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]: http://www.deepdyve.com/assets/images/DeepDyve-Logo-lg.png ACM Transactions on Algorithms (TALG) Association for Computing Machinery

Constant factor approximations for the hotlink assignment problem

ACM Transactions on Algorithms (TALG) , Volume 7 (2) – Mar 1, 2011

Loading next page...
 
/lp/association-for-computing-machinery/constant-factor-approximations-for-the-hotlink-assignment-problem-LddWAxDvH8

References

References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.

Publisher
Association for Computing Machinery
Copyright
Copyright © 2011 by ACM Inc.
ISSN
1549-6325
DOI
10.1145/1921659.1921662
Publisher site
See Article on Publisher Site

Abstract

Constant Factor Approximations for the Hotlink Assignment Problem TOBIAS JACOBS, University of Freiburg The concept of hotlink assignment aims at reducing the navigation effort for the users of a Web directory or similar structure by inserting a limited number of additional hyperlinks called hotlinks. The k-hotlink assignment problem denotes the task of adding at most k outgoing hotlinks to each page of a tree-like site, minimizing the path length, that is, the expected number of œclicks  necessary for the user to reach her destination page. Another common formulation of this problem is to maximize the gain, that is, the path length reduction achieved by the assignment. In this work we analyze the natural greedy strategy, proving that it reaches the optimal gain up to the constant factor of 2. Considering the gain, we also prove the existence of a PTAS. Finally, we give a polynomial-time 2-approximation for the 1-hotlink assignment problem, which constitutes the rst constant factor approximation in terms of the path length. The algorithms ™ performance analyses are made possible by a set of three new basic operations for the transformation of hotlink assignments. Categories and Subject Descriptors: F.2.2 [Analysis of Algorithms and Problem Complexity]:

Journal

ACM Transactions on Algorithms (TALG)Association for Computing Machinery

Published: Mar 1, 2011

There are no references for this article.