Lenzen, Christoph Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Vahidi, Hossein Algorithms and Complexity, MPI for Informatics, Max Planck Society;
Lenzen, C., & Vahidi, H. (2021). Approximate Minimum Directed Spanning Trees Under Congestion. In T. Jurdziński, & S. Schmid (Eds.), Structural Information and Communication Complexity (pp. 352-369). Berlin: Springer. doi:10.1007/978-3-030-79527-6_20.