6 citations · 9 across the 4 of their papers we have counts for
Showing cs.DSShow all
3 papers · 1 filter
cs.DS2023★ 1 cited
Breaking 3-Factor Approximation for Correlation Clustering in Polylogarithmic Rounds
Nairen Cao, Shang-En Huang, Hsin-Hao Su
In this paper, we study parallel algorithms for the correlation clustering problem, where every pair of two different entities is labeled with similar or dissimilar. The goal is to…
cs.DS2022
Nested Active-Time Scheduling
Nairen Cao, Jeremy T. Fineman, Shi Li +3
The active-time scheduling problem considers the problem of scheduling preemptible jobs with windows (release times and deadlines) on a parallel machine that can schedule up to …
cs.DS2019★ 2 cited
Efficient Construction of Directed Hopsets and Parallel Approximate Shortest Paths
Nairen Cao, Jeremy T. Fineman, Katina Russell
The approximate single-source shortest-path problem is as follows: given a graph with nonnegative edge weights and a designated source vertex , return estimates of the distances…