Minimum cost source location problem with local 3-vertex-connectivity requirements.

Toshimasa Ishii Hitoshi Fujita Hiroshi Nagamochi

Published in: Theor. Comput. Sci. (2007)

Keyphrases

minimum cost
undirected graph
np hard
approximation algorithms
spanning tree
network flow
network flow problem
network simplex algorithm
capacity constraints
minimum cost flow
connected components
np complete
strongly connected