Improved approximations for the hotlink assignment problem

DOI10.1145/1978782.1978794MaRDI QIDQ3189023zbMATH OpenOpenAlexFDO

Authors Marco Molinaro, Eduardo S. Laber

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/1978782.1978794

zbMATH Keywords

approximation algorithmshotlink assignment

Mathematics Subject Classification ID

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

Recommendations

• Hotlink assignment.
• Constant Factor Approximations for the Hotlink Assignment Problem
• Constant factor approximations for the hotlink assignment problem
• On the complexity of optimal hotlink assignment
• Approximation algorithm for hotlink assignment in the greedy model

Cited in

(10)

• Approximation algorithm for hotlink assignment in the greedy model
• Approximate hotlink assignment
• On the complexity of optimal hotlink assignment
• Optimal approximability of bookmark assignments
• Constant factor approximations for the hotlink assignment problem
• Constant Factor Approximations for the Hotlink Assignment Problem
• Multiple hotlink assignment
• An Experimental Study of Recent Hotlink Assignment Algorithms
• An experimental study of recent hotlink assignment algorithms
• Efficient algorithms for the hotlink assignment problem: The worst case search

This page was built for publication: Improved 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 Q3189023)