2015 Fiscal Year Final Research Report
Development of algorithms for the server-assignment problem to maximize available capacity of networks
| Project/Area Number |
25330003
|
|---|
| Research Category |
Grant-in-Aid for Scientific Research (C)
|
| Allocation Type | Multi-year Fund |
|---|
| Section | 一般 |
|---|
| Research Field |
Theory of informatics
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
ITO TAKEHIRO 東北大学, 情報科学研究科, 准教授 (40431548)
|
|---|
| Project Period (FY) |
2013-04-01 – 2016-03-31
|
| Keywords | アルゴリズム / グラフ理論 |
|---|
| Outline of Final Research Achievements |
We modeled the following situation as a graph problem: In a network, we wish to find a way of data distributions from servers to all users to avoid any congestion of network links. We studied the complexity status of this problem from the viewpoint of graph structures, and clarified how the complexity status depends on the number of cycles or the number of servers in a graph. In many cases, this problem is computationally intractable, and hence we gave pseudo-polynomial-time algorithms based on a dynamic programming method and fixed-parameter algorithms.
|
| Free Research Field |
理論計算機科学
|
