Complementing Missing and Inaccurate Profiling Using a Minimum Cost Circulation Algorithm.

Roy Levin Ilan Newman Gadi Haber

Published in: HiPEAC (2008)

Keyphrases

np hard
minimum cost
dynamic programming
computational complexity
network flow
matching algorithm
objective function
np complete
randomly generated
spanning tree
approximation ratio
optimal solution
worst case
path planning
integer programming
network flow problem