Constant Factor Approximations for the Hotlink Assignment Problem

DOI10.1007/978-3-540-73951-7_17zbMATH Open1209.68036OpenAlexW2137091452MaRDI QIDQ3603526FDOQ3603526

Authors: Tobias Jacobs 

Publication date: 17 February 2009

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

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_17

Recommendations

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

zbMATH Keywords

dynamic programminggraph theoryapproximation algorithmsgreedy algorithmshotlink assignment

Mathematics Subject Classification ID

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

Cited In (8)

• Resource Management in Large Networks
• Approximation algorithm for hotlink assignments in web directories.
• Hotlink assignment.
• Approximation algorithm for hotlink assignment in the greedy model
• On the complexity of optimal hotlink assignment
• Structural Information and Communication Complexity
• Constant factor approximations for the hotlink assignment problem
• Improved approximations for the hotlink assignment problem

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 Q3603526)