Let G = (V, E) be a simple undirected graph with a set V of vertices and a set E of edges. Each vertex v ∈ V has a demand d(v) ∈ Z + and a cost c(v) ∈ R + , where Z + and R + denote the set of nonnegative integers and the set of nonnegative reals, respectively. The source location problem with vertex-connectivity requirements in a given graph G requires finding a set S of vertices minimizing v∈S c(v) such that there are at least d(v) pairwise vertex-disjoint paths from S to v for each vertex v ∈ V − S. It is known that if there exists a vertex v ∈ V with d(v) ≥ 4, then the problem is NP-hard even in the case where every vertex has a uniform cost. In this paper, we show that the problem can be solved in O(|V | 4 log 2 |V |) time if d(v) ≤ 3 holds for each vertex v ∈ V .
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.