“…Most existing formulations, with some exceptions [10,52,53], are special cases of the multidimensional assignment problem [25]: Input detections are arranged in a graph whose edges encode similarity and whose nodes are then partitioned into identities. Formulations with polynomial time solutions consider evidence along paths of time-consecutive edges [8,16,31,37,38,39,55,75,78] and some build on bipartite matching [12,14,20,26,42,62,71]. Methods that use all pairwise terms, not only timeconsecutive ones, are significantly more accurate but NPhard [18,25,27,28,41,58,61,65,66,67].…”