Approximate hotlink assignment
From MaRDI portal
Publication:2390237
Recommendations
- scientific article; zbMATH DE number 2081037
- Near-Entropy Hotlink Assignments
- Near-entropy hotlink assignments
- scientific article; zbMATH DE number 2044936
- 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?)
- scientific article; zbMATH DE number 2044936 (Why is no real title available?)
- scientific article; zbMATH DE number 2080232 (Why is no real title available?)
- Towards adaptive Web sites: Conceptual framework and case study
Cited in
(10)- On the complexity of optimal hotlink assignment
- Dynamic hotlinks
- scientific article; zbMATH DE number 2080232 (Why is no real title available?)
- scientific article; zbMATH DE number 2081037 (Why is no real title available?)
- Algorithms and Computation
- Algorithms and Data Structures
- Near-Entropy Hotlink Assignments
- Automata, Languages and Programming
- Algorithms and Computation
- 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)