Minimum cost subpartitions in graphs.
Hiroshi NagamochiYoko KamidoiPublished in: Inf. Process. Lett. (2007)
Keyphrases
- minimum cost
- spanning tree
- undirected graph
- np hard
- approximation algorithms
- network flow problem
- network flow
- capacity constraints
- network simplex algorithm
- graph matching
- random graphs
- worst case
- upper bound
- np complete
- graph theoretic
- graph representation
- minimum cost path
- minimum cost flow
- computational complexity
- branch and bound algorithm
- directed graph