Browsing Estadística e Investigación Operativa by Subject "NP-Complete problems"
Now showing items 1-1 of 1
-
Article
Polynomial algorithms for partitioning a tree into single-center subtrees to minimize flat service costs
(Wiley, 2008)This paper deals with the following graph partitioning problem. Consider a connected graph with n nodes, p of which are ...