The b-branching problem in digraphs

by   Naonori Kakimura, et al.
Keio University
Hosei University

In this paper, we introduce the concept of b-branchings in digraphs, which is a generalization of branchings serving as a counterpart of b-matchings. Here b is a positive integer vector on the vertex set of a digraph, and a b-branching is defined as a common independent set of two matroids defined by b: an arc set is a b-branching if it has at most b(v) arcs sharing the terminal vertex v, and it is an independent set of a certain sparsity matroid defined by b. We demonstrate that b-branchings yield an appropriate generalization of branchings by extending several classical results on branchings. We first present a multi-phase greedy algorithm for finding a maximum-weight b-branching. We then prove a packing theorem extending Edmonds' disjoint branchings theorem, and provide a strongly polynomial algorithm for finding optimal disjoint b-branchings. As a consequence of the packing theorem, we prove the integer decomposition property of the b-branching polytope. Finally, we deal with a further generalization in which a matroid constraint is imposed on the b(v) arcs sharing the terminal vertex v.


page 1

page 2

page 3

page 4


M-convexity of the minimum-cost packings of arborescences

In this paper, we first prove that the minimum-cost packings of disjoint...

A 5k-vertex Kernel for P_2-packing

The P_2-packing problem asks for whether a graph contains k vertex-disjo...

The b-bibranching Problem: TDI System, Packing, and Discrete Convexity

In this paper, we introduce the b-bibranching problem in digraphs, which...

FPT algorithms for packing k-safe spanning rooted sub(di)graphs

We study three problems introduced by Bang-Jensen and Yeo [Theor. Comput...

(Arc-disjoint) cycle packing in tournament: classical and parameterized complexity

Given a tournament T, the problem MaxCT consists of finding a maximum (a...

Tree decompositions with bounded independence number: beyond independent sets

We continue the study of graph classes in which the treewidth can only b...

Spencer's theorem in nearly input-sparsity time

A celebrated theorem of Spencer states that for every set system S_1,…, ...

Please sign up or login with your details

Forgot password? Click here to reset