Login / Signup
A hop constrained min-sum arborescence with outage costs.
Rakesh Kawatra
Published in:
Comput. Oper. Res. (2007)
Keyphrases
</>
min sum
np hard
lower bound
min cut
goal programming
image processing
pairwise
computer vision
computational complexity
low level
markov random field
information theoretic