Approximation algorithm for hotlink assignment in the greedy model

DOI10.1016/J.TCS.2007.03.045zbMath1123.68016OpenAlexW2114631252MaRDI QIDQ2383606

David Peleg, Rachel Matichin

Publication date: 19 September 2007

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2007.03.045

zbMATH Keywords

search algorithmsWWWhotlinks

Mathematics Subject Classification ID

Searching and sorting (68P10) Network design and communication in computer systems (68M10) Computing methodologies for information systems (hypertext navigation, interfaces, decision support, etc.) (68U35) Approximation algorithms (68W25)

Related Items (2)

On the complexity of optimal hotlink assignment ⋮ Optimal approximability of bookmark assignments

Cites Work

• Unnamed Item
• Unnamed Item
• Asymmetric communication protocols via hotlink assignments
• Algorithms and Computation
• Algorithms and Data Structures

This page was built for publication: Approximation algorithm for hotlink assignment in the greedy model