Before revision:  The problem in general is NP-hard, but we show that in a certain parameter regime it is equivalent to a bipartite matching problem , meaning that it is polynomial timesolvable in this regime .
After revision:  The problem in general is NP-hard, we highlight a parameter regime for the bipartite objective where the problem reduces to the bipartite matching problem , meaning that it is polynomial timesolvable in this regime .