Using dual concepts in graph minor algorithms

• Project/Area Number: 24700004
• Research Category: Grant-in-Aid for Young Scientists (B)
• Allocation Type: Multi-year Fund
• Research Field: Fundamental theory of informatics
• Research Institution: University of Tsukuba (2015-2016); The University of Tokyo (2012-2014)
• Principal Investigator: KOBAYASHI Yusuke 筑波大学, システム情報系, 准教授 (40581591)
• Project Period (FY): 2012-04-01 – 2017-03-31
• Project Status: Completed (Fiscal Year 2016)
• Budget Amount: ¥4,680,000 (Direct Cost: ¥3,600,000、Indirect Cost: ¥1,080,000); Fiscal Year 2015: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2014: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2013: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000); Fiscal Year 2012: ¥1,170,000 (Direct Cost: ¥900,000、Indirect Cost: ¥270,000)
• Keywords: アルゴリズム / グラフ / 組合せ最適化 / 辺素パス問題 / グラフマイナー理論 / グラフアルゴリズム

Outline of Final Research Achievements

The edge-disjoint paths problem is a problem of connecting given pairs of vertices by edge-disjoint paths, which is motivated by applications in VLSI design and transportation networks. This problem is also theoretically interesting, because it was solved by using graph minor theory, which is a profound theory in discrete mathematics. In this study, we show efficient algorithms for the edge-disjoint paths problem and its related problems by using a certain kind of duality in the problems.

Research Products

• [Int'l Joint Research] Eotovos University(Hungary)
• [Journal Article] Finding a shortest non-zero path in group-labeled graphs via permanent computation (2017)
  • Author(s): Yusuke Kobayashi and Sho Toyooka
  • Journal Title: Algorithmica Volume: 77 Issue: 4 Pages: 1128-1142
  • DOI: 10.1007/s00453-016-0142-y
  • NAID: 120007129195
  • Peer Reviewed / Open Access / Acknowledgement Compliant
• [Journal Article] Packing edge-disjoint odd Eulerian subgraphs through prescribed vertices in 4-edge-connected graphs (2017)
  • Author(s): Naonori Kakimura, Ken-ichi Kawarabayashi, and Yusuke Kobayashi
  • Journal Title: SIAM Journal on Discrete Mathematics Volume: 印刷中
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Edge-disjoint odd cycles in 4-edge-connected graphs (2016)
  • Author(s): Ken-ichi Kawarabayashi, Yusuke Kobayashi
  • Journal Title: J. Comb. Theory, Ser. B Volume: 119 Pages: 12-27
  • DOI: 10.1016/j.jctb.2015.12.002
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Covering intersecting bi-set families under matroid constraints (2016)
  • Author(s): Kristof Berczi, Tamas Kiraly, and Yusuke Kobayashi
  • Journal Title: SIAM Journal on Discrete Mathematics Volume: 30 Issue: 3 Pages: 1758-1774
  • DOI: 10.1137/15m1049099
  • NAID: 120007129312
  • Peer Reviewed / Open Access / Int'l Joint Research
• [Journal Article] An Improved Approximation Algorithm for the Edge-Disjoint Paths Problem with Congestion Two (2016)
  • Author(s): Ken-ichi Kawarabayashi, Yusuke Kobayashi
  • Journal Title: ACM Trans. Algorithms Volume: 13 Issue: 1 Pages: 1-17
  • DOI: 10.1145/2960410
  • NAID: 120007135027
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Improved max-flow min-cut algorithms in a circular disk failure model with application to a road network (2016)
  • Author(s): Kensuke Otsuki, Yusuke Kobayashi, and Kazuo Murota
  • Journal Title: European Journal of Operational Research Volume: 248 Issue: 2 Pages: 396-403
  • DOI: 10.1016/j.ejor.2015.07.035
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (2015)
  • Author(s): Ken-ichi Kawarabayashi and Yusuke Kobayashi
  • Journal Title: Combinatorica Volume: 35 Issue: 4 Pages: 477-495
  • DOI: 10.1007/s00493-014-2828-6
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] The complexity of minimizing the difference of two M${}^\natural$-convex set functions (2015)
  • Author(s): Yusuke Kobayashi
  • Journal Title: Operations Research Letters Volume: 43 Issue: 6 Pages: 573-574
  • DOI: 10.1016/j.orl.2015.08.011
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Routing algorithms under mutual interference constraints (2015)
  • Author(s): Kota Ishihara and Yusuke Kobayashi
  • Journal Title: Journal of the Operations Research Society of Japan Volume: 58 Pages: 209-222
  • NAID: 130005096749
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] The generalized terminal backup problem (2015)
  • Author(s): Attila Bernath, Yusuke Kobayashi, and Tatsuya Matsuoka
  • Journal Title: SIAM Journal on Discrete Mathematics Volume: 29 Issue: 3 Pages: 1764-1782
  • DOI: 10.1137/140972858
  • Peer Reviewed / Int'l Joint Research / Acknowledgement Compliant
• [Journal Article] Triangle-free 2-matchings and M-concave functions on jump systems (2014)
  • Author(s): Y. Kobayashi
  • Journal Title: Discrete Applied Mathematics Volume: 175 Pages: 35-42
  • DOI: 10.1016/j.dam.2014.05.016
  • Peer Reviewed
• [Journal Article] Max-flow min-cut theorem and faster algorithms in a circular disk failure model (2014)
  • Author(s): Y. Kobayashi and K. Otsuki
  • Journal Title: Proceedings of the 33rd Annual IEEE International Conference on Computer Communications Volume: - Pages: 1635-1643
  • DOI: 10.1109/infocom.2014.6848100
  • Peer Reviewed
• [Journal Article] Minimum-Cost b-Edge Dominating Sets on Trees (2014)
  • Author(s): Takehiro Ito, Naonori Kakimura, Naoyuki Kamiyama, Yusuke Kobayashi, and Yoshio Okamoto
  • Journal Title: Lecture Notes in Computer Science Volume: 8889 Pages: 195-207
  • DOI: 10.1007/978-3-319-13075-0_16
  • ISBN: 9783319130743, 9783319130750
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] An excluded half-integral grid theorem for digraphs and the directed disjoint paths problem (2014)
  • Author(s): K. Kawarabayashi, Y. Kobayashi, and S. Kreutzer
  • Journal Title: Proceedings of the 46th ACM Symposium on Theory of Computing Volume: - Pages: 70-78
  • DOI: 10.1145/2591796.2591876
  • Peer Reviewed / Acknowledgement Compliant
• [Journal Article] Selecting vertex disjoint paths in plane graphs (2014)
  • Author(s): H. Flier, Y. Kobayashi, M. Mihalak, A. Schobel, P. Widmayer, and A. Zych
  • Journal Title: Networks Volume: 未定
  • Peer Reviewed
• [Journal Article] The edge-disjoint paths problem in Eulerian graphs and 4-edge-connected graphs (2014)
  • Author(s): K. Kawarabayashi and Y. Kobayashi
  • Journal Title: Combinatorica Volume: 未定
  • Peer Reviewed
• [Journal Article] Robust matchings and matroid intersections (2013)
  • Author(s): R. Fujita, Y. Kobayashi, and K. Makino
  • Journal Title: SIAM Journal on Discrete Mathematics Volume: 27 Issue: 3 Pages: 1234-1256
  • DOI: 10.1137/100808800
  • Peer Reviewed
• [Journal Article] An O(log n)-approximation algorithm for the edge-disjoint paths problem in Eulerian planar graphs (2013)
  • Author(s): K. Kawarabayashi and Y. Kobayashi
  • Journal Title: ACM Transactions on Algorithms Volume: 9 Issue: 2 Pages: 1-13
  • DOI: 10.1145/2438645.2438648
  • Peer Reviewed
• [Journal Article] Testing the (s,t)-disconnectivity of graphs and digraphs (2012)
  • Author(s): Yuichi Yoshida and Yusuke Kobayashi
  • Journal Title: Theoretical Computer Science Volume: 434 Pages: 98-113
  • DOI: 10.1016/j.tcs.2012.01.045
  • Peer Reviewed
• [Journal Article] An algorithm for finding a maximum t-matching excluding complete partite subgraphs (2012)
  • Author(s): Yusuke Kobayashi and Xin Yin
  • Journal Title: Discrete Optimization Volume: 9 Issue: 2 Pages: 98-108
  • DOI: 10.1016/j.disopt.2012.02.003
  • Peer Reviewed
• [Journal Article] Algorithms for finding a maximum non-k-linked graph (2012)
  • Author(s): Yusuke Kobayashi and Yuichi Yoshida
  • Journal Title: SIAM Journal on Discrete Mathematics Volume: 26 Issue: 2 Pages: 591-604
  • DOI: 10.1137/110846725
  • Peer Reviewed
• [Journal Article] A Proof of Cunningham's Conjecture on Restricted Subgraphs and Jump Systems (2012)
  • Author(s): Y. Kobayashi, J. Szabo, K. Takazawa
  • Journal Title: Journal of Combinatorial Theory, Series B Volume: published online Issue: 4 Pages: 948-966
  • DOI: 10.1016/j.jctb.2012.03.003
  • Peer Reviewed
• [Journal Article] Fixed-parameter tractability for the subset feedback set problem and the S-cycle packing problem (2012)
  • Author(s): K. Kawarabayashi and Y. Kobayashi
  • Journal Title: Journal of Combinatorial Theory, Series B Volume: 102 Issue: 4 Pages: 1020-1034
  • DOI: 10.1016/j.jctb.2011.12.001
  • Peer Reviewed
• [Journal Article] Cone superadditivity of discrete convex functions (2012)
  • Author(s): Y. Kobayashi, K. Murota and R. Weismantel
  • Journal Title: Mathematical Programming, Series A Volume: 135 Issue: 1-2 Pages: 25-44
  • DOI: 10.1007/s10107-011-0447-1
  • Peer Reviewed
• [Presentation] The directed disjoint shortest paths problem (2016)
  • Author(s): Yusuke Kobayashi
  • Organizer: Southern Italian Workshop on Algorithms and Graphs 2016
  • Place of Presentation: Puglia, Italy
  • Year and Date: 2016-09-25
  • Int'l Joint Research
• [Presentation] Randomized strategies for cardinality robustness in the knapsack problem (2016)
  • Author(s): Yusuke Kobayashi
  • Organizer: The 13th Meeting on Analytic Algorithmics and Combinatorics
  • Place of Presentation: Arlington, Virginia, USA
  • Year and Date: 2016-01-11
  • Int'l Joint Research
• [Presentation] Finding a path in group-labeled graphs with two labels forbidden (2015)
  • Author(s): Yutaro Yamaguchi
  • Organizer: The 42nd International Colloquium on Automata, Languages, and Programming
  • Place of Presentation: グランドプリンスホテル京都（京都府京都市）
  • Year and Date: 2015-07-06
  • Int'l Joint Research
• [Presentation] 有向木詰め込みに関する最大最小定理 (2015)
  • Author(s): 小林佑輔
  • Organizer: 日本オペレーションズ・リサーチ学会「最適化の基盤とフロンティア」研究部会（WOO）
  • Place of Presentation: 東京理科大学，東京
  • Year and Date: 2015-03-28
  • Invited
• [Presentation] Max-flow min-cut theorem and faster algorithms in a circular disk failure model (2014)
  • Author(s): 小林佑輔
  • Organizer: JST ERATO 河原林巨大グラフプロジェクト・感謝祭 Summer 2014
  • Place of Presentation: 国立情報学研究所，東京
  • Year and Date: 2014-08-08
  • Invited
• [Presentation] Packing edge-disjoint odd S-cycles in 4-edge-connected graphs (2014)
  • Author(s): Yusuke Kobayashi
  • Organizer: SIAM Conference on Discrete Mathematics 2014
  • Place of Presentation: Minneapolis, USA
  • Year and Date: 2014-06-16 – 2014-06-19
  • Invited
• [Presentation] Max-flow min-cut theorem and faster algorithms in a circular disk failure model, (2014)
  • Author(s): Yusuke Kobayashi
  • Organizer: The 33rd Annual IEEE International Conference on Computer Communications (INFOCOM 2014)
  • Place of Presentation: Toronto, Canada
  • Year and Date: 2014-04-27 – 2014-05-02
• [Presentation] The generalized terminal backup problem (2014)
  • Author(s): A. Bernath and Y. Kobayashi
  • Organizer: The 25th Annual ACM-SIAM Symposium on Discrete Algorithms
  • Place of Presentation: Portland, Oregon, USA
• [Presentation] Triangle-free 2-matchings and M-concave functions on jump systems (2013)
  • Author(s): Y. Kobayashi
  • Organizer: The 8th Hungarian-Japanese Symposium on Discrete Mathematics and Its Applications
  • Place of Presentation: Veszprem, Hungary
• [Presentation] Linear min-max relation between the treewidth of H-minor-free graphs and its largest grid minor (2013)
  • Author(s): K. Kawarabayashi and Y. Kobayashi
  • Organizer: The Asian Mathematical Conference 2013
  • Place of Presentation: Busan, Korea
  • Invited
• [Presentation] All-or-nothing multicommodity flow problem with bounded fractionality in planar graphs (2013)
  • Author(s): K. Kawarabayashi and Y. Kobayashi
  • Organizer: The 54th Annual IEEE Symposium on Foundations of Computer Science
  • Place of Presentation: Berkeley, California, USA
• [Presentation] An algorithm for finding a maximum t-matching excluding complete partite subgraphs (2012)
  • Author(s): Yusuke Kobayashi
  • Organizer: The 21st International Symposium on Mathematical Programming
  • Place of Presentation: Berlin, Germany
• [Remarks] Publications of Yusuke Kobayashi
  • URL: http://infoshako.sk.tsukuba.ac.jp/~kobayashi/research.html
• [Remarks] Publications and Talks of Yusuke Kobayashi
  • URL: http://infoshako.sk.tsukuba.ac.jp/~kobayashi/research.html
• [Remarks] Publications and Talks of Yusuke Kobayashi
  • URL: http://www.misojiro.t.u-tokyo.ac.jp/~y-koba/research.htm
• [Remarks] Publications and Talks of Yusuke Kobayashi
  • URL: http://www.misojiro.t.u-tokyo.ac.jp/~y-koba/research.htm