M-convexity of the minimum-cost packings of arborescences

by   Kenjiro Takazawa, et al.
Hosei University

In this paper, we first prove that the minimum-cost packings of disjoint k arborescences (minimum-cost k-arborescences) induce an M-convex function defined on the integer vectors on the vertex set. This M-convexity provides a short proof for a theorem of Bernáth and Király (SODA 2016) stating that the root vectors of the minimum-cost k-arborescences form a base polyhedron of a submodular function. We then extend this M-convexity to the M^-convexity of the minimum-cost k-branchings. The proof is based on a new theorem on packing disjoint k-branchings, which extends Edmonds' disjoint branchings theorem and is of independent interest. Finally, building upon this M^-convexity, we present a new problem called the prize-collecting k-branching problem, and show that it can be solved in strongly polynomial time if the penalty function is M^-convex.


page 1

page 2

page 3

page 4


The b-branching problem in digraphs

In this paper, we introduce the concept of b-branchings in digraphs, whi...

Strongly Convex Divergences

We consider a sub-class of the f-divergences satisfying a stronger conve...

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

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

Almost Sure Uniqueness of a Global Minimum Without Convexity

This paper provides a theorem for the set of global minimizers, the argm...

Learning Weakly Convex Sets in Metric Spaces

We introduce the notion of weak convexity in metric spaces, a generaliza...

The Convexity and Concavity of Envelopes of the Minimum-Relative-Entropy Region for the DSBS

In this paper, we prove that for the doubly symmetric binary distributio...

Convexity and Duality in Optimum Real-time Bidding and Related Problems

We study problems arising in real-time auction markets, common in e-comm...

Please sign up or login with your details

Forgot password? Click here to reset