19 citations · 31 across the 6 of their papers we have counts for
6 papers
A simple approximation algorithm for the internal Steiner minimum tree
Bang Ye Wu
For a metric graph and , the internal Steiner minimum tree problem asks for a minimum weight Steiner tree spanning such that every vertex in is not a…
Parameterized algorithms for the 2-clustering problem with minimum sum and minimum sum of squares objective functions
Bang Ye Wu, Li-Hsuan Chen
In the {\sc Min-Sum 2-Clustering} problem, we are given a graph and a parameter , and the goal is to determine if there exists a 2-partition of the vertex set such that the tota…
A linear time algorithm for the next-to-shortest path problem on undirected graphs with nonnegative edge lengths
Bang Ye Wu, Jun-Lin Guo, Yue-Li Wang
For two vertices and in a graph , the next-to-shortest path is an -path which length is minimum amongst all -paths strictly longer than the shortest path l…
A simpler and more efficient algorithm for the next-to-shortest path problem
Bang Ye Wu
Given an undirected graph with positive edge lengths and two vertices and , the next-to-shortest path problem is to find an -path which length is minimum among…
Algorithms for the minimum non-separating path and the balanced connected bipartition problems on grid graphs (With erratum)
Bang Ye Wu
For given a pair of nodes in a graph, the minimum non-separating path problem looks for a minimum weight path between the two nodes such that the remaining graph after removing the…
The maximum disjoint paths problem on multi-relations social networks
Bang Ye Wu
Motivated by applications to social network analysis (SNA), we study the problem of finding the maximum number of disjoint uni-color paths in an edge-colored graph. We show the NP-…