On Approximation of Bookmark Assignments

Consider a rooted directed acyclic graph G = (V,E) with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the probability that a user wants to access the node v. The access cost is defined as the expected number of steps required to reach a node from the root r. A bookmark is an additional shortcut from r to a node of G, which may reduce the access cost. The bookmark assignment problem is to find a set of bookmarks that achieves the greatest improvement in the access cost. For the problem, the paper presents a polynomial time approximation algorithm with factor (1-1/e), and shows that there exists no polynomial time approximation algorithm with a better constant factor than (1-1/e) unless NP ⊆ DT IME(NO(log logN)), where N is the size of the inputs.

[1]  Eduardo Sany Laber,et al.  Efficient Algorithms for the Hotlink Assignment Problem: The Worst Case Search , 2004, ISAAC.

[2]  Sven Fuhrmann,et al.  Multiple Hotlink Assignment , 2001, WG.

[3]  Ronald L. Rivest,et al.  Introduction to Algorithms , 1990 .

[4]  Bowen Alpern,et al.  Incremental evaluation of computational circuits , 1990, SODA '90.

[5]  David Peleg,et al.  Approximation algorithm for hotlink assignment in the greedy model , 2007, Theor. Comput. Sci..

[6]  M. L. Fisher,et al.  An analysis of approximations for maximizing submodular set functions—I , 1978, Math. Program..

[7]  Michael Langberg,et al.  Approximation Algorithms for Maximization Problems Arising in Graph Partitioning , 2001, J. Algorithms.

[8]  Andrzej Pelc,et al.  Assigning Bookmarks in Perfect Binary Trees , 2007, Ars Comb..

[9]  Alberto Marchetti-Spaccamela,et al.  Maintaining a Topological Order Under Edge Insertions , 1996, Inf. Process. Lett..

[10]  Samir Khuller,et al.  The Budgeted Maximum Coverage Problem , 1999, Inf. Process. Lett..

[11]  Bo Li,et al.  On the Optimal Placement of Web Proxies in the Internet: The Linear Topology , 1998, HPN.

[12]  Andrzej Pelc,et al.  Enhancing Hyperlink Structure for Improving Web Performance , 2002, J. Web Eng..

[13]  Erez Petrank.  The hardness of approximation: Gap location , 2005, computational complexity.

[14]  Rakesh V. Vohra,et al.  A Probabilistic Analysis of the Maximal Covering Location Problem , 1993, Discret. Appl. Math..

[15]  Ronald L. Rivest,et al.  Introduction to Algorithms, Second Edition , 2001 .

[16]  Dorit S. Hochbaum,et al.  Approximation Algorithms for NP-Hard Problems , 1996 .

[17]  Andrzej Pelc,et al.  Strategies for Hotlink Assignments , 2000, ISAAC.

[18]  David Peleg,et al.  Approximation Algorithm for Hotlink Assignments in Web Directories , 2003, WADS.

[19]  Oren Etzioni,et al.  Towards adaptive Web sites: Conceptual framework and case study , 1999, Artif. Intell..

[20]  Bo Li,et al.  On the optimal placement of web proxies in the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).