Approximate hotlink assignment
From MaRDI portal
Publication:2390237
Recommendations
- Approximate hotlink assignment
- Near-Entropy Hotlink Assignments
- Near-entropy hotlink assignments
- Multiple hotlink assignment
- Improved approximations for the hotlink assignment problem
- On the complexity of optimal hotlink assignment
- On the Complexity of Optimal Hotlink Assignment
- Approximation algorithm for hotlink assignments in web directories.
- An experimental study of recent hotlink assignment algorithms
- An Experimental Study of Recent Hotlink Assignment Algorithms
Cites work
- Algorithms and Computation
- Approximation algorithm for hotlink assignments in web directories.
- Asymmetric communication protocols via hotlink assignments
- scientific article; zbMATH DE number 1052006 (Why is no real title available?)
- Multiple hotlink assignment
- Strategies for hotlink assignments
- Towards adaptive Web sites: Conceptual framework and case study
Cited in
(10)- On the complexity of optimal hotlink assignment
- Dynamic hotlinks
- Strategies for hotlink assignments
- Approximate hotlink assignment
- Algorithms and Computation
- Algorithms and Data Structures
- Near-Entropy Hotlink Assignments
- Optimal website design with the constrained subtree selection problem
- Efficient algorithms for the hotlink assignment problem: The worst case search
- Near-entropy hotlink assignments
This page was built for publication: Approximate hotlink assignment
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2390237)