The B-branching problem in digraphs

Naonori Kakimura, Naoyuki Kamiyama, Kenjiro Takazawa

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

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 bbranching 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.

Original languageEnglish
Title of host publication43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018
EditorsIgor Potapov, James Worrell, Paul Spirakis
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Volume117
ISBN (Print)9783959770866
DOIs
Publication statusPublished - 2018 Aug 1
Event43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 - Liverpool, United Kingdom
Duration: 2018 Aug 272018 Aug 31

Other

Other43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018
CountryUnited Kingdom
CityLiverpool
Period18/8/2718/8/31

Fingerprint

Polynomials
Decomposition

Keywords

  • Arborescence
  • Greedy algorithm
  • Matroid intersection
  • Packing
  • Sparsity matroid

ASJC Scopus subject areas

  • Software

Cite this

Kakimura, N., Kamiyama, N., & Takazawa, K. (2018). The B-branching problem in digraphs. In I. Potapov, J. Worrell, & P. Spirakis (Eds.), 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018 (Vol. 117). [12] Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. https://doi.org/10.4230/LIPIcs.MFCS.2018.12

The B-branching problem in digraphs. / Kakimura, Naonori; Kamiyama, Naoyuki; Takazawa, Kenjiro.

43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. ed. / Igor Potapov; James Worrell; Paul Spirakis. Vol. 117 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018. 12.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Kakimura, N, Kamiyama, N & Takazawa, K 2018, The B-branching problem in digraphs. in I Potapov, J Worrell & P Spirakis (eds), 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. vol. 117, 12, Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018, Liverpool, United Kingdom, 18/8/27. https://doi.org/10.4230/LIPIcs.MFCS.2018.12
Kakimura N, Kamiyama N, Takazawa K. The B-branching problem in digraphs. In Potapov I, Worrell J, Spirakis P, editors, 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. Vol. 117. Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing. 2018. 12 https://doi.org/10.4230/LIPIcs.MFCS.2018.12
Kakimura, Naonori ; Kamiyama, Naoyuki ; Takazawa, Kenjiro. / The B-branching problem in digraphs. 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018. editor / Igor Potapov ; James Worrell ; Paul Spirakis. Vol. 117 Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing, 2018.
@inproceedings{45a6e87366df42b281088962cc5b1f2e,
title = "The B-branching problem in digraphs",
abstract = "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 bbranching 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.",
keywords = "Arborescence, Greedy algorithm, Matroid intersection, Packing, Sparsity matroid",
author = "Naonori Kakimura and Naoyuki Kamiyama and Kenjiro Takazawa",
year = "2018",
month = "8",
day = "1",
doi = "10.4230/LIPIcs.MFCS.2018.12",
language = "English",
isbn = "9783959770866",
volume = "117",
editor = "Igor Potapov and James Worrell and Paul Spirakis",
booktitle = "43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018",
publisher = "Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing",

}

TY - GEN

T1 - The B-branching problem in digraphs

AU - Kakimura, Naonori

AU - Kamiyama, Naoyuki

AU - Takazawa, Kenjiro

PY - 2018/8/1

Y1 - 2018/8/1

N2 - 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 bbranching 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.

AB - 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 bbranching 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.

KW - Arborescence

KW - Greedy algorithm

KW - Matroid intersection

KW - Packing

KW - Sparsity matroid

UR - http://www.scopus.com/inward/record.url?scp=85053211348&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=85053211348&partnerID=8YFLogxK

U2 - 10.4230/LIPIcs.MFCS.2018.12

DO - 10.4230/LIPIcs.MFCS.2018.12

M3 - Conference contribution

SN - 9783959770866

VL - 117

BT - 43rd International Symposium on Mathematical Foundations of Computer Science, MFCS 2018

A2 - Potapov, Igor

A2 - Worrell, James

A2 - Spirakis, Paul

PB - Schloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing

ER -