Login / Signup
On the complexity of testing membership in the core of min-cost spanning tree games.
Ulrich Faigle
Walter Kern
Sándor P. Fekete
Winfried Hochstättler
Published in:
Int. J. Game Theory (1997)
Keyphrases
</>
spanning tree
min cost
minimum cost
minimum spanning tree
max flow
network flow
minimum weight
computational complexity
worst case
approximation algorithms
undirected graph
np hard
greedy algorithm
weighted graph