Login / Signup
The family of cost monotonic and cost additive rules in minimum cost spanning tree problems.
Gustavo Bergantiños
Leticia Lorenzo
Silvia Lorenzo-Freire
Published in:
Soc. Choice Welf. (2010)
Keyphrases
</>
minimum cost
spanning tree
network flow problem
np hard
minimum cost flow
approximation algorithms
network flow
network simplex algorithm
minimum cost path
capacity constraints
minimum spanning tree
minimum spanning trees
lowest cost
special case
np complete
network design problem
undirected graph
minimum weight