19 citations · 31 across the 6 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.DS2013★ 1 cited
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…
cs.DS2013★ 3 cited
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…