Improving the location of minisum facilities through network modification
Annals of Operations Research - Special issue on locational decisions
Approximation algorithms for NP-hard problems
Approximation algorithms for NP-hard problems
Approximation algorithms for finding highly connected subgraphs
Approximation algorithms for NP-hard problems
Design networks with bounded pairwise distance
STOC '99 Proceedings of the thirty-first annual ACM symposium on Theory of computing
Strategies for Hotlink Assignments
ISAAC '00 Proceedings of the 11th International Conference on Algorithms and Computation
Approximate Hotlink Assignment
ISAAC '01 Proceedings of the 12th International Symposium on Algorithms and Computation
Approximate hotlink assignment
Information Processing Letters
Near-entropy hotlink assignments
ESA'06 Proceedings of the 14th conference on Annual European Symposium - Volume 14
Designing self-adaptive websites using online hotlink assignment algorithm
Proceedings of the 7th International Conference on Advances in Mobile Computing and Multimedia
Constant factor approximations for the hotlink assignment problem
ACM Transactions on Algorithms (TALG)
Enhancing hyperlink structure for improving web performance
Journal of Web Engineering
Four-layer framework for combinatorial optimization problems domain
Advances in Engineering Software
WADS'05 Proceedings of the 9th international conference on Algorithms and Data Structures
Efficient algorithms for the hotlink assignment problem: the worst case search
ISAAC'04 Proceedings of the 15th international conference on Algorithms and Computation
General Theory of Information Transfer and Combinatorics
On approximation of bookmark assignments
MFCS'07 Proceedings of the 32nd international conference on Mathematical Foundations of Computer Science
Constant factor approximations for the hotlink assignment problem
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Optimal approximability of bookmark assignments
Discrete Applied Mathematics
| Hi-index | 0.00 |
The input for the hotlink assignment problem consists of a node weighted directed acyclic graph with a designated root node r. The goal is to minimize the weighted shortest path length rooted at r by adding a restricted number of outgoing arcs (hotlinks) to each node. The (h, k)-hotlink assignment problem is defined on k-regular complete trees, and at most h hotlinks can be assigned to each node. We contribute algorithms for the (1, k), (2, k), and (k-1, k) hotlink assignment problem.