| Budget Amount *help |
¥3,770,000 (Direct Cost: ¥2,900,000、Indirect Cost: ¥870,000)
Fiscal Year 2016: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2014: ¥1,430,000 (Direct Cost: ¥1,100,000、Indirect Cost: ¥330,000)
|
|---|
| Outline of Final Research Achievements |
In this research project, we developed a new theory of discrete structures across multicommodity flow, facility location, and network design problems in discrete optimization. In particular, we partially extended discrete convex analysis, which was a theory of discrete convex functions on the integer lattice, to more general discrete structures. Based on this theory, we developed combinatorial polynomial time algorithms to classes of multicommodity flow problems for which such good algorithms had not been known before. As an application, we provided a combinatorial 2-approximation algorithm to the node-multiway cut problem.
|
