11 citations · 26 across the 18 of their papers we have counts for
19 papers
Sublinear Approximation Schemes for Scheduling Precedence Graphs of Bounded Depth
Bin Fu, Yumei Huo, Hairong Zhao
We study the classical scheduling problem on parallel machines %with precedence constraints where the precedence graph has the bounded depth . Our goal is to minimize the maximu…
Reachability in Restricted Chemical Reaction Networks
Robert M. Alaniz, Bin Fu, Timothy Gomez +5
The popularity of molecular computation has given rise to several models of abstraction, one of the more recent ones being Chemical Reaction Networks (CRNs). These are equivalent t…
Multitasking Scheduling with Shared Processing
Bin Fu, Yumei Huo, Hairong Zhao
Recently, the problem of multitasking scheduling has attracted a lot of attention in the service industries where workers frequently perform multiple tasks by switching from one ta…
Speeding Up Constrained -Means Through 2-Means
Qilong Feng, Bin Fu
For the constrained 2-means problem, we present a time algorithm. It generates a collection of approximate center pairs $(…
Polyhedra Circuits and Their Applications
Bin Fu, Pengfei Gu, Yuming Zhao
We introduce polyhedra circuits. Each polyhedra circuit characterizes a geometric region in . They can be applied to represent a rich class of geometric objects, whic…
Approximate Set Union Via Approximate Randomization
Bin Fu, Pengfei Gu, Yuming Zhao
We develop an randomized approximation algorithm for the size of set union problem $\arrowvert A_1\cup A_2\cup...\cup A_m\arrowvert$, which given a list of sets with…