Optimal approximability of bookmark assignments

DOI10.1016/J.DAM.2013.05.018MaRDI QIDQ2444527zbMATH OpenOpenAlexFDO

Authors Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono

Publication date 10 April 2014

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2013.05.018

zbMATH Keywords

approximation algorithmbookmark assignmentinapproximability

Mathematics Subject Classification ID

Directed graphs (digraphs), tournaments (05C20) Internet topics (68M11) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)

Recommendations

• On Approximation of Bookmark Assignments
• Approximation algorithm for hotlink assignment in the greedy model
• Approximation algorithm for hotlink assignments in web directories.
• scientific article; zbMATH DE number 2080232
• Improved approximations for the hotlink assignment problem

Cites work

• A probabilistic analysis of the maximal covering location problem
• A threshold of ln n for approximating set cover
• Algorithms and Computation
• An analysis of approximations for maximizing submodular set functions—I
• An experimental study of recent hotlink assignment algorithms
• Approximation algorithm for hotlink assignment in the greedy model
• Approximation algorithm for hotlink assignments in web directories.
• Assigning bookmarks in perfect binary trees.
• Constant factor approximations for the hotlink assignment problem
• scientific article; zbMATH DE number 2044936 (Why is no real title available?)
• scientific article; zbMATH DE number 2080232 (Why is no real title available?)
• Improved approximations for the hotlink assignment problem
• Introduction to algorithms
• On the complexity of optimal hotlink assignment
• The web proxy location problem in general tree of rings networks
• Towards adaptive Web sites: Conceptual framework and case study

Cited in

(2)

• On Approximation of Bookmark Assignments
• Automated category tree construction: hardness bounds and algorithms

This page was built for publication: Optimal approximability of bookmark assignments

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