Access the full text.
Sign up today, get DeepDyve free for 14 days.
References for this paper are not available at this time. We will be adding them shortly, thank you for your patience.
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]:
ACM Transactions on Algorithms (TALG) – Association for Computing Machinery
Published: Mar 1, 2011
Read and print from thousands of top scholarly journals.
Already have an account? Log in
Bookmark this article. You can see your Bookmarks on your DeepDyve Library.
To save an article, log in first, or sign up for a DeepDyve account if you don’t already have one.
Copy and paste the desired citation format or use the link below to download a file formatted for EndNote
Access the full text.
Sign up today, get DeepDyve free for 14 days.
All DeepDyve websites use cookies to improve your online experience. They were placed on your computer when you launched this website. You can change your cookie settings through your browser.