6 citations · 12 across the 5 of their papers we have counts for
1 paper · 1 filter
Niko Beerenwinkel, Stefano Beretta, Paola Bonizzoni +2
The Minimum Path Cover problem on directed acyclic graphs (DAGs) is a classical problem that provides a clear and simple mathematical formulation for several applications in differ…