Minimum cost source location problem with vertex-connectivity requirements in digraphs.

Hiroshi Nagamochi Toshimasa Ishii Hiro Ito

Published in: Inf. Process. Lett. (2001)

Keyphrases

minimum cost
undirected graph
spanning tree
np hard
approximation algorithms
network flow
strongly connected
network simplex algorithm
network flow problem
directed graph
random graphs
capacity constraints
connected components
triangle mesh
edit operations
minimum cost flow
worst case