most citedEfficient Approximation Algorithms for Scheduling Coflows with Total Weighted Completion Time in Identical Parallel Networks

5 citations · 7 across the 2 of their papers we have counts for

collaborators
Showing cs.DSShow all

Nothing from them under that filter.

Their other years and fields are still on the left.