Bounded-Diameter Minimum-Cost Graph Problems.

Sanjiv Kapoor Mohammad Sarwat

Published in: Theory Comput. Syst. (2007)

Keyphrases

minimum cost
spanning tree
network flow problem
minimum cost flow
approximation algorithms
np hard
np complete
minimum cost path
random walk
special case
distance measure
weighted graph