5 citations · 7 across the 2 of their papers we have counts for
2 papers
cs.DS2023★ 2 cited
Efficient Approximation Algorithms for Scheduling Coflows with Precedence Constraints in Identical Parallel Networks to Minimize Weighted Completion Time
Chi-Yeh Chen
This paper focuses on the problem of coflow scheduling with precedence constraints in identical parallel networks, which is a well-known -hard problem. Coflow is a re…
cs.DS2023★ 5 cited
Efficient Approximation Algorithms for Scheduling Coflows with Total Weighted Completion Time in Identical Parallel Networks
Chi-Yeh Chen
This paper addresses the scheduling problem of coflows in identical parallel networks, which is a well-known -hard problem. Coflow is a relatively new network abstraction used…