@inbook{2f79d6479fe04ef0bdf90e919634d579,
title = "Approximation algorithm for hotlink assignments in web directories",
abstract = "Hotlink assignment concerns the addition of shortcut links to information structures based on linked nodes such as the web. Each node in the structure is associated with a weight representing the frequency that node is accessed by users. To access a node, the user must follow the path leading to it from the root. Introducing additional edges (hotlinks) to the structure may reduce its access cost, taken to be the expected number of steps needed to reach a node from the root. The hotlink assignment problem is to find a set of hotlinks achieving the greatest improvement in the access cost. This paper introduces an approximation algorithm for this problem with approximation ratio 2.",
author = "Rachel Matichin and David Peleg",
year = "2003",
doi = "10.1007/978-3-540-45078-8_24",
language = "אנגלית",
isbn = "3540405453",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
publisher = "Springer Verlag",
pages = "271--280",
editor = "Frank Dehne and Jorg-Rudiger Sack and Michiel Smid",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
address = "גרמניה",
}