Solving Multiple People Tracking in a Minimum Cost Arborescence.

Roberto Henschel Laura Leal-Taixé Bodo Rosenhahn

Published in: WACV Workshops (2015)

Keyphrases

minimum cost
network flow problem
linear relaxation
np hard
approximation algorithms
spanning tree
network flow
undirected graph
capacity constraints
network simplex algorithm
worst case
integer program
minimum weight
minimum cost flow