A probabilistic analysis of the maximal covering location problem
Discrete Applied Mathematics - Special issue: local optimization
Approximation algorithms for NP-hard problems
A threshold of ln n for approximating set cover
Journal of the ACM (JACM)
Towards adaptive Web sites: conceptual framework and case study
WWW '99 Proceedings of the eighth international conference on World Wide Web
Introduction to algorithms
Strategies for Hotlink Assignments
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
WG '01 Proceedings of the 27th International Workshop on Graph-Theoretic Concepts in Computer Science
On the Optimal Placement of Web Proxies in the Internet: The Linear Topology
HPN '98 Proceedings of the IFIP TC-6 Eigth International Conference on High Performance Networking
Enhancing hyperlink structure for improving web performance
Enhancing hyperlink structure for improving web performance
Approximation algorithm for hotlink assignment in the greedy model
Theoretical Computer Science
An experimental study of recent hotlink assignment algorithms
Journal of Experimental Algorithmics (JEA)
Constant factor approximations for the hotlink assignment problem
ACM Transactions on Algorithms (TALG)
Improved approximations for the hotlink assignment problem
ACM Transactions on Algorithms (TALG)
On the Complexity of Optimal Hotlink Assignment
Algorithmica
Efficient algorithms for the hotlink assignment problem: the worst case search
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
| Hi-index | 0.04 |
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 shows the tight bound on the (in)approximability under the assumption PNP: we present a polynomial time approximation algorithm with factor (1-1/e), and show that there exists no polynomial time approximation algorithm with a better constant factor than (1-1/e) unless P=NP.