Blocking Optimal k-Arborescences

DOI10.1137/1.9781611974331.CH115zbMath1414.90302arXiv1507.04207OpenAlexW4242867367MaRDI QIDQ4575699

Attila Bernáth, Tamás Király

Publication date: 16 July 2018

Published in: Proceedings of the Twenty-Seventh Annual ACM-SIAM Symposium on Discrete Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1507.04207

zbMATH Keywords

coveringmatroidspolynomial-time algorithmsarborescences

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)

Related Items (4)

Packing of arborescences with matroid constraints via matroid intersection ⋮ The \(b\)-branching problem in digraphs ⋮ Unnamed Item ⋮ Blocking unions of arborescences

This page was built for publication: Blocking Optimal k-Arborescences