On packing time-respecting arborescences

DOI10.1016/J.DISOPT.2022.100702zbMath1509.05144arXiv2203.01096MaRDI QIDQ6392596

Zoltán Szigeti, Romain Chapoullié

Publication date: 2 March 2022

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Graph algorithms (graph-theoretic aspects) (05C85) Directed graphs (digraphs), tournaments (05C20)

This page was built for publication: On packing time-respecting arborescences