Approximating minimum cost source location problems with local vertex-connectivity demands.

Takuro Fukunaga

Published in: J. Discrete Algorithms (2013)

Keyphrases

minimum cost
location problems
capacity constraints
undirected graph
single facility
bicriteria
np hard
approximation algorithms
network flow
spanning tree
network flow problem
network simplex algorithm
minimum cost flow
efficient solutions
connected components
strongly connected
special case
linear programming