6 papers
Optimal matroid bases with intersection constraints: Valuated matroids, M-convex functions, and their applications
Yuni Iwamasa, Kenjiro Takazawa
For two matroids and with the same ground set and two cost functions and on , we consider the problem of finding bases of and of…
A Note on a Nearly Uniform Partition into Common Independent Sets of Two Matroids
Satoru Fujishige, Kenjiro Takazawa, Yu Yokoi
The present note is a strengthening of a recent paper by K. Takazawa and Y. Yokoi (A generalized-polymatroid approach to disjoint common independent sets in two matroids, Discrete…
A Generalized-Polymatroid Approach to Disjoint Common Independent Sets in Two Matroids
Kenjiro Takazawa, Yu Yokoi
In this paper, we investigate the classes of matroid intersection admitting a solution for the problem of partitioning the ground set into common independent sets, where $E…
The -bibranching Problem: TDI System, Packing, and Discrete Convexity
Kenjiro Takazawa
In this paper, we introduce the -bibranching problem in digraphs, which is a common generalization of the bibranching and -branching problems. The bibranching problem, introd…
The -branching problem in digraphs
Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa
In this paper, we introduce the concept of -branchings in digraphs, which is a generalization of branchings serving as a counterpart of -matchings. Here is a positive int…
Excluded -factors in Bipartite Graphs: Unified Framework for Nonbipartite Matchings, Restricted 2-matchings, and Matroids
Kenjiro Takazawa
We propose a framework for optimal -matchings excluding the prescribed -factors in bipartite graphs. The proposed framework is a generalization of the nonbipartite matching p…