Constant factor approximations for the hotlink assignment problem

DOI10.1145/1921659.1921662MaRDI QIDQ3188998zbMATH OpenOpenAlexFDO

Authors Tobias Jacobs

Publication date 9 September 2014

Published in ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/1921659.1921662

zbMATH Keywords

approximation algorithmssearch trees

Mathematics Subject Classification ID

Internet topics (68M11) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• Constant Factor Approximations for the Hotlink Assignment Problem
• On the Complexity of Optimal Hotlink Assignment
• On the complexity of optimal hotlink assignment
• Hotlink assignment.
• Improved approximations for the hotlink assignment problem

Cited in

(8)

• Approximation algorithm for hotlink assignment in the greedy model
• Optimal approximability of bookmark assignments
• Improved approximations for the hotlink assignment problem
• On the Complexity of Optimal Hotlink Assignment
• Constant Factor Approximations for the Hotlink Assignment Problem
• scientific article; zbMATH DE number 2044936 (Why is no real title available?)
• Structural Information and Communication Complexity
• Approximation algorithm for hotlink assignments in web directories.

This page was built for publication: Constant factor approximations for the hotlink assignment problem

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