Login / Signup
Robustness of Minimum Cost Arborescences.
Naoyuki Kamiyama
Published in:
ISAAC (2011)
Keyphrases
</>
minimum cost
network flow
np hard
approximation algorithms
network flow problem
spanning tree
capacity constraints
network simplex algorithm
undirected graph
minimum cost flow
bayesian networks
objective function
distance measure
np complete
primal dual
edit operations