On approximation of bookmark assignments

Yuichi Asahiro, Eiji Miyano, Toshihide Murata, Hirotaka Ono

研究成果: Chapter in Book/Report/Conference proceedingConference contribution

抄録

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(NO(log log N)), where N is the size of the inputs.

本文言語英語
ホスト出版物のタイトルMathematical Foundations of Computer Science 2007 - 32nd International Symposium, MFCS 2007, Proceedings
出版社Springer Verlag
ページ115-124
ページ数10
ISBN(印刷版)9783540744559
DOI
出版ステータス出版済み - 2007
イベント32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007 - Cesky Krumlov, チェコ共和国
継続期間: 8 26 20078 31 2007

出版物シリーズ

名前Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
4708 LNCS
ISSN(印刷版)0302-9743
ISSN(電子版)1611-3349

その他

その他32nd International Symposium on Mathematical Foundations of Computer Science, MFCS 2007
Countryチェコ共和国
CityCesky Krumlov
Period8/26/078/31/07

All Science Journal Classification (ASJC) codes

  • Theoretical Computer Science
  • Computer Science(all)

フィンガープリント 「On approximation of bookmark assignments」の研究トピックを掘り下げます。これらがまとまってユニークなフィンガープリントを構成します。

引用スタイル