| Budget Amount *help |
¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000)
Fiscal Year 2015: ¥1,560,000 (Direct Cost: ¥1,200,000、Indirect Cost: ¥360,000)
Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
Fiscal Year 2013: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| 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.
|
