• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to project page

2011 Fiscal Year Final Research Report

New Developments in Arborescence Packing Problems

Research Project

  • PDF
Project/Area Number 22700016
Research Category

Grant-in-Aid for Young Scientists (B)

Allocation TypeSingle-year Grants
Research Field Fundamental theory of informatics
Research InstitutionKyushu University (2011)
Chuo University (2010)

Principal Investigator

KAMIYAMA Naoyuki  九州大学, マス・フォア・インダストリ研究所, 准教授 (10548134)

Project Period (FY) 2010 – 2011
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.

  • Research Products

    (6 results)

All 2012 2011 2010 Other

All Journal Article (2 results) (of which Peer Reviewed: 2 results) Presentation (4 results)

  • [Journal Article] The root location problem for arc-disjoint arborescences

    • Author(s)
      Satoru Fujishige and Naoyuki Kamiyama
    • Journal Title

      Discrete Applied Mathematics

    • Peer Reviewed
  • [Journal Article] Robustness of minimum cost arborescences

    • Author(s)
      Naoyuki Kamiyama
    • Journal Title

      Japan Journal of Industrial and Applied Mathematics

    • Peer Reviewed
  • [Presentation] 優先度制約付きマトロイド交差問題,冬のLAシンポジウム2012

    • Author(s)
      神山直之
    • Place of Presentation
      京都大学
    • Year and Date
      2012-02-01
  • [Presentation] Robustness of minimum cost arborescences2011

    • Author(s)
      Naoyuki Kamiyama
    • Organizer
      The 22nd International Symposium on Algorithms and Computation
    • Place of Presentation
      ワークピア横浜
    • Year and Date
      2011-12-06
  • [Presentation] 最小費用有向木のロバスト性に関する研究2011

    • Author(s)
      神山直之
    • Organizer
      日本応用数理学会2011年度年会
    • Place of Presentation
      同志社大学
    • Year and Date
      2011-09-14
  • [Presentation] 有向木詰め込み問題の歴史と最先端2010

    • Author(s)
      神山直之
    • Organizer
      日本オペレーションズ・リサーチ学会秋季研究発表会
    • Place of Presentation
      コラッセ福島
    • Year and Date
      2010-09-17

URL: 

Published: 2013-07-31  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi