The maximum integer multiterminal flow problem in directed graphs

Given an arc-capacitated digraph and k terminal vertices, the directed maximum integer multiterminal flow   problem is to route the maximum number of flow units between the terminals. We introduce a new parameter kL⩽kkL⩽k for this problem and study its complexity with respect to kLkL.