Approximation algorithm for hotlink assignments in web directories.

DOI10.1007/B11837MaRDI QIDQ5900760zbMATH OpenFDO

Authors Rachel Matichin, David Peleg

Publication date 20 April 2010

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/B11837

Mathematics Subject Classification ID

Internet topics (68M11) Approximation algorithms (68W25)

Recommendations

• Approximation algorithm for hotlink assignment in the greedy model
• Structural Information and Communication Complexity
• Constant factor approximations for the hotlink assignment problem
• On the Complexity of Optimal Hotlink Assignment
• Constant Factor Approximations for the Hotlink Assignment Problem

Cited in

(8)

• Approximation algorithm for hotlink assignment in the greedy model
• Approximate hotlink assignment
• On the complexity of optimal hotlink assignment
• Optimal approximability of bookmark assignments
• On Approximation of Bookmark Assignments
• An Experimental Study of Recent Hotlink Assignment Algorithms
• Structural Information and Communication Complexity
• An experimental study of recent hotlink assignment algorithms

This page was built for publication: Approximation algorithm for hotlink assignments in web directories.

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