Minimum Cost <=k Edges Connected Subgraph Problems.

Firdovsi Sharifov Hakan Kutucu

Published in: Electron. Notes Discret. Math. (2010)

Keyphrases

minimum cost
np hard
spanning tree
network flow problem
minimum cost flow
linear relaxation
approximation algorithms
undirected graph
similarity measure
special case
scheduling problem
np complete
connected components
network design problem
network simplex algorithm