6 citations · 6 across the 2 of their papers we have counts for
2 papers
cs.DS2023
Random-Order Enumeration for Self-Reducible NP-Problems
Pengyu Chen, Dongjing Miao, Weitian Tong +3
In plenty of data analysis tasks, a basic and time-consuming process is to produce a large number of solutions and feed them into downstream processing. Various enumeration algorit…
cs.DS2022★ 6 cited
A polynomial-time approximation scheme for parallel two-stage flowshops under makespan constraint
Weitian Tong, Yao Xu, Huili Zhang
As a hybrid of the Parallel Two-stage Flowshop problem and the Multiple Knapsack problem, we investigate the scheduling of parallel two-stage flowshops under makespan constraint, w…