The Maximum Colorful Arborescence problem: How (computationally) hard can it be?

Guillaume Fertin, Julien Fradin, GĂ©raldine Jean. The Maximum Colorful Arborescence problem: How (computationally) hard can it be?. Theoretical Computer Science, 852:104-120, 2021. [doi]

Abstract

Abstract is missing.