Space Efficient Algorithms and Time-Space Trade offs for Geometric Data
| Project/Area Number |
16K16006
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Multi-year Fund |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Kyushu Institute of Technology |
|---|
Principal Investigator |
Saitoh Toshiki 九州工業大学, 大学院情報工学研究院, 准教授 (00590390)
|
|---|
| Project Period (FY) |
2016-04-01 – 2019-03-31
|
| Project Status |
Completed (Fiscal Year 2018)
|
| Budget Amount *help |
¥4,030,000 (Direct Cost: ¥3,100,000、Indirect Cost: ¥930,000)
Fiscal Year 2018: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2017: ¥1,300,000 (Direct Cost: ¥1,000,000、Indirect Cost: ¥300,000)
Fiscal Year 2016: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
|
|---|
| Keywords | アルゴリズム / データ構造 / グラフ / 計算困難性 / 幾何構造 / 省領域アルゴリズム / 幾何データ |
|---|
| Outline of Final Research Achievements |
We require efficient algorithms for big data. However, we cannot store the data into memory because of the size of the data. We need efficient algorithms which work in the sub linear space. In this research, we developed space efficient algorithms for geometric data. Especially, we proposed efficient algorithms on intervals and circular arcs. We also investigated the effectiveness of the space efficient data structures by the computer experiments.
|
| Academic Significance and Societal Importance of the Research Achievements |
本研究では，区間を中心とした幾何データに対する効率的な省領域アルゴリズムを開発した．提案したアルゴリズムは任意の入力サイズおよび計算領域で動作するため，どれだけ巨大なデータでも必ず停止することを保証している．本アルゴリズムを適用することにより，様々な高次元のデータに対する近似アルゴリズムの開発などを考えることができる．
|
Report
(4 results)
Research Products
(43 results)
-
-
-
-
-
-
-
-
[Journal Article] Sequentially Swapping Colored Tokens on Graphs2019
Author(s)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, and Takeaki Uno
-
Journal Title
Journal of Graph Algorithms and Applications
Volume: 23
Issue: 1
Pages: 3-27
DOI
NAID
Related Report
Peer Reviewed / Open Access / Int'l Joint Research
-
-
[Journal Article] Swapping colored token on graphs2018
Author(s)
K. Yamanaka, T. Horiyama, J. M. Keil, D. G. Kirkpatrick, Y. Otachi, T. Saitoh, R. Uehara and Y. Uno
-
Journal Title
Theoretical Computer Science
Volume: 729
Pages: 1-10
DOI
NAID
Related Report
Peer Reviewed / Int'l Joint Research
-
-
[Journal Article] Exact Algorithms for the Max-Min Dispersion Problem2018
Author(s)
Toshihiro Akagi, Tetsuya Araki, Takashi Horiyama, Shin-Ichi Nakano, Yoshio Okamoto, Yota Otachi, Toshiki Saitoh, Ryuhei Uehara, Takeaki Uno, Kunihiro Wasa
-
Journal Title
Proceedings of 12th International Frontiers of Algorithmics Workshop (FAW 2018)
Volume: ---
Pages: 263-272
DOI
NAID
ISBN
9783319784540, 9783319784557
Related Report
Peer Reviewed
-
-
[Journal Article] Complexity of the maximum k-path vertex cover problem2018
Author(s)
Eiji Miyano, Toshiki Saitoh, Ryuhei Uehara, Tsuyoshi Yagita, Tom C. van der Zanden
-
Journal Title
Proc. 12th Annual Workshop on Algorithms and Computation (WALCOM 2018)
Volume: LNCS10755
Pages: 240-251
DOI
NAID
ISBN
9783319751719, 9783319751726
Related Report
Peer Reviewed / Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
-
-
[Presentation] Sequentially Swapping Colored Tokens on Graphs2017
Author(s)
Katsuhisa Yamanaka, Erik D. Demaine, Takashi Horiyama, Akitoshi Kawamura, Shin-Ichi Nakano, Yoshio Okamoto, Toshiki Saitoh, Akira Suzuki, Ryuhei Uehara, and Takeaki Uno
Organizer
The 11th Annual Workshop on Algorithms and Computation (WALCOM 2017)
Place of Presentation
Hsinchu (Taiwan)
Year and Date
2017-03-29
Related Report
Int'l Joint Research
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
-
