Updating Directed Minimum Cost Spanning Trees.

Gerasimos G. Pollatos Orestis Telelis Vassilis Zissimopoulos

Published in: WEA (2006)

Keyphrases

spanning tree
minimum cost
np hard
edge disjoint
approximation algorithms
minimum spanning tree
network flow problem
network flow
undirected graph
capacity constraints
minimum spanning trees
network simplex algorithm
optimal solution
minimum cost flow
edit operations
integer programming
special case