Width Parameters for Minimum Flow Decomposition

Andreas Grigorjew, Wanchote Jiamjitrak, Brendan Mumey +1

Minimum flow decomposition (MFD) is the strongly NP-hard problem of finding a smallest set of integer weighted $s$-$t$ paths in an $s$-$t$ DAG $G$ whose weighted sum is equal to a…