On Approximation of Bookmark Assignments

DOI10.1007/978-3-540-74456-6_12MaRDI QIDQ3525561zbMATH OpenOpenAlexFDO

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

Publication date 17 September 2008

Published in Mathematical Foundations of Computer Science 2007 (Search for Journal in Brave)

Full work available at URL http://hdl.handle.net/2324/14891

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Approximation algorithms (68W25) Programming involving graphs or networks (90C35)

Recommendations

• Optimal approximability of bookmark assignments
• Approximation algorithm for hotlink assignment in the greedy model
• scientific article; zbMATH DE number 2080232
• Approximation algorithm for hotlink assignments in web directories.
• Structural Information and Communication Complexity

Cited in

(1)

• Optimal approximability of bookmark assignments

This page was built for publication: On Approximation of Bookmark Assignments

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