Journal
COMPUTERS & OPERATIONS RESEARCH
Volume 38, Issue 12, Pages 1766-1774Publisher
PERGAMON-ELSEVIER SCIENCE LTD
DOI: 10.1016/j.cor.2011.02.016
Keywords
Complexity; Critical node problem; Multicut in trees; Dynamic programming
Ask authors/readers for more resources
In this paper we deal with the critical node problem (CNP), i.e., the problem of searching for a given number K of nodes in a graph G, whose removal minimizes the (weighted or unweighted) number of connections between pairs of nodes in the residual graph. In particular, we study the case where the physical network represented by graph G has a hierarchical organization, so that G is a tree. The NP-completeness of this problem for general graphs has been already established (Arulselvan et al.). We study the subclass of CNP over trees, generalizing the objective function and constraints to take into account general nonnegative costs of node connections and weights for the nodes that are to be removed. We prove that CNP over trees is still NP-complete when general connection costs are specified, while the cases where all connections have unit cost are solvable in polynomial time by dynamic programming approaches. For the case with nonnegative connection costs and unit node weights we propose an enumeration scheme whose time complexity is within a polynomial factor from 0(1.618034), where n is the number of nodes of the tree. Results from computational experiments are reported for all the proposed algorithms. (C) 2011 Elsevier Ltd. All rights reserved.
Authors
I am an author on this paper
Click your name to claim this paper and add it to your profile.
Reviews
Recommended
No Data Available