Sciweavers

IPL
2007
76views more  IPL 2007»
13 years 11 months ago
Minimum cost subpartitions in graphs
Given an edge-weighted graph G = (V,E), a subset S ⊆ V , an integer k 1 and a real b 0, the minimum subpartition problem asks to find a family of k nonempty disjoint subsets X1...
Hiroshi Nagamochi, Yoko Kamidoi