Presentation 2007-05-25
On Approximation of Bookmark Assignments
Yuichi ASAHIRO, Eiji MIYANO, Hirotaka ONO, Toshihide MURATA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Consider a rooted directed acyclic graph G=(V,E)with root r, representing a collection V of web pages connected via a set E of hyperlinks. Each node v is associated with the probability that a user wants to access the node v. The access cost is defined as the expected number of steps required to reach a node from the root r. A bookmark is an additional shortcut from r to a node of G, which may reduce the access cost. The bookmark assignment problem is to find a set of bookmarks that achieves the greatest improvement in the access cost. For the problem, the paper presents a polynomial time approximation algorithm with factor(1-1/e), and shows that there exists no polynomial time approximation algorithm with a better constant factor than(1-1/e)unless NP⫅DTIME(N^), where is the size of the inputs.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) bookmark assignment problem / directed acyclic graph / approximability / inapproximability
Paper # COMP2007-11
Date of Issue

Conference Information
Committee COMP
Conference Date 2007/5/18(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) On Approximation of Bookmark Assignments
Sub Title (in English)
Keyword(1) bookmark assignment problem
Keyword(2) directed acyclic graph
Keyword(3) approximability
Keyword(4) inapproximability
1st Author's Name Yuichi ASAHIRO
1st Author's Affiliation Dept of Social Information Systems, Kyushu Sangyo University()
2nd Author's Name Eiji MIYANO
2nd Author's Affiliation Dept of Systems Innovation and Informatics, Kyushu Inst of Technology
3rd Author's Name Hirotaka ONO
3rd Author's Affiliation Kyushu University,
4th Author's Name Toshihide MURATA
4th Author's Affiliation Dept of Systems Innovation and Informatics, Kyushu Inst of Technology
Date 2007-05-25
Paper # COMP2007-11
Volume (vol) vol.107
Number (no) 73
Page pp.pp.-
#Pages 6
Date of Issue