• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Design of Optimal Online Algorithms by Analytical Estimation of Work Functions

Research Project

Project/Area Number 17K00010
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Theory of informatics
Research InstitutionKanazawa University

Principal Investigator

Matsubayashi Akira  金沢大学, 電子情報通信学系, 准教授 (10282378)

Project Period (FY) 2017-04-01 – 2020-03-31
Project Status Completed (Fiscal Year 2019)
Budget Amount *help
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2019: ¥780,000 (Direct Cost: ¥600,000、Indirect Cost: ¥180,000)
Fiscal Year 2018: ¥3,250,000 (Direct Cost: ¥2,500,000、Indirect Cost: ¥750,000)
Fiscal Year 2017: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Keywordsオンラインアルゴリズム / ページ移動問題 / k-外平面グラフ / ファイル配置問題 / オンラインシュタイナー木問題 / 仕事関数 / アルゴリズム
Outline of Final Research Achievements

We studied online algorithms and obtained the following results. First, we proposed an algorithm improving the previous algorithms for the page migration problem on the Euclidean space. Then, through a better embedding of k-outer planar graphs into random tree networks, we obtained online algorithms improving the previous algorithms for various online problems. This embedding also gives a better approximation algorithms for various problems.

Academic Significance and Societal Importance of the Research Achievements

オンライン問題の幅広いクラスに対して既存研究を超える性能のアルゴリズム,ならびに様々な最適化問題に対する近似アルゴリズムを与えており,学術的に意義がある.これらのオンライン問題は現時点までに得られた情報のみから将来に渡ってコストを最小化するようなシステム構築や運用に付随する,困難であるが現実的に重要な課題の解決方法を提示するもので,社会的にも意義がある.

Report

(4 results)
  • 2019 Annual Research Report   Final Research Report ( PDF )
  • 2018 Research-status Report
  • 2017 Research-status Report
  • Research Products

    (5 results)

All 2020 2018 Other

All Journal Article (2 results) Presentation (2 results) Remarks (1 results)

  • [Journal Article] Better Embedding of k-Outerplanar Graphs into Random Trees2020

    • Author(s)
      Akira Matsubayashi
    • Journal Title

      情報処理学会研究報告

      Volume: 2020-AL-177

    • Related Report
      2019 Annual Research Report
  • [Journal Article] An Improved Algorithm for Uniform Page Migration on Euclidean Space2018

    • Author(s)
      Akira Matsubayashi
    • Journal Title

      情報処理学会研究報告

      Volume: 2018-AL-170

    • Related Report
      2018 Research-status Report
  • [Presentation] Better Embedding of k-Outerplanar Graphs into Random Trees2020

    • Author(s)
      Akira Matsubayashi
    • Organizer
      情報処理学会第177回アルゴリズム研究会
    • Related Report
      2019 Annual Research Report
  • [Presentation] An Improved Algorithm for Uniform Page Migration on Euclidean Space2018

    • Author(s)
      松林 昭
    • Organizer
      情報処理学会第170回アルゴリズム研究会
    • Related Report
      2018 Research-status Report
  • [Remarks] 金沢大学,並列計算・ネットワーク研究室webページ

    • URL

      http://carrera.ec.t.kanazawa-u.ac.jp/

    • Related Report
      2019 Annual Research Report 2018 Research-status Report 2017 Research-status Report

URL: 

Published: 2017-04-28   Modified: 2021-02-19  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi