Submodularity of minimum-cost spanning tree games.

Masayuki Kobayashi Yoshio Okamoto

Published in: Networks (2014)

Keyphrases

minimum cost
spanning tree
np hard
minimum spanning tree
approximation algorithms
network flow
minimum weight
capacity constraints
minimum spanning trees
network flow problem
network simplex algorithm
minimum cost flow
undirected graph
edge weights
worst case
search algorithm
edit operations
minimum total cost