New Developments in Arborescence Packing Problems
| Project/Area Number |
22700016
|
|---|
| Research Category |
Grant-in-Aid for Young Scientists (B)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
Fundamental theory of informatics
|
|---|
| Research Institution | Kyushu University (2011)
Chuo University (2010) |
|---|
Principal Investigator |
KAMIYAMA Naoyuki 九州大学, マス・フォア・インダストリ研究所, 准教授 (10548134)
|
|---|
| Project Period (FY) |
2010 – 2011
|
| Project Status |
Completed (Fiscal Year 2011)
|
| Budget Amount *help |
¥2,860,000 (Direct Cost: ¥2,200,000、Indirect Cost: ¥660,000)
Fiscal Year 2011: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
Fiscal Year 2010: ¥1,690,000 (Direct Cost: ¥1,300,000、Indirect Cost: ¥390,000)
|
|---|
| Keywords | 有向グラフ / 有向木 / グラフ詰め込み / 配置問題 |
|---|
| Research Abstract |
In this research, we studied arborescence packing problems that is one of fundamental problems in directed graphs. Our main results can be described as follows. The first one is the polynomial-time solvability and intractability of the root location problem for arc-disjoint arborescences. The second one is the weighted version of the min-max theorem for arc-disjoint arborescences. The last one is the algorithm using a DM decomposition for the matroid intersection problem with priority constraints that is related to packing arborescences.
|
Report
(3 results)
Research Products
(12 results)
