An Experimental Study of Recent Hotlink Assignment Algorithms

DOI10.1137/1.9781611972887.14MaRDI QIDQ5233516zbMATH OpenOpenAlexFDO

Authors Tobias Jacobs

Publication date 11 September 2019

Published in 2008 Proceedings of the Tenth Workshop on Algorithm Engineering and Experiments (ALENEX) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1137/1.9781611972887.14

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25) Internet topics (68M11)

Recommendations

• An experimental study of recent hotlink assignment algorithms
• On the complexity of optimal hotlink assignment
• On the Complexity of Optimal Hotlink Assignment
• Algorithms and Computation
• Improved approximations for the hotlink assignment problem
• Approximation algorithm for hotlink assignments in web directories.
• Approximation algorithm for hotlink assignment in the greedy model
• Structural Information and Communication Complexity
• Near-Entropy Hotlink Assignments

Cited in

(6)

• An experimental study of recent hotlink assignment algorithms
• Hotlink assignment.
• Approximation algorithm for hotlink assignment in the greedy model
• On the complexity of optimal hotlink assignment
• Approximate hotlink assignment
• On the Complexity of Optimal Hotlink Assignment

This page was built for publication: An Experimental Study of Recent Hotlink Assignment Algorithms

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5233516)