4 papers
Randomized Rounding over Dynamic Programs
Etienne Bamas, Shi Li, Lars Rohwedder
We show that under mild assumptions for a problem whose solutions admit a dynamic programming-like recurrence relation, we can still find a solution under additional packing constr…
Learning-Augmented Streaming Algorithms for Correlation Clustering
Yinhao Dong, Shan Jiang, Shi Li +1
We study streaming algorithms for Correlation Clustering. Given a graph as an arbitrary-order stream of edges, with each edge labeled as positive or negative, the goal is to partit…
Complexity and Approximation Algorithms for Fixed Charge Transportation Problems
Yong Chen, Shi Li, Zihao Liang
The Fixed Charge Transportation (FCT) problem models transportation scenarios where we need to send a commodity from sources to sinks, and the cost of sending a commodity f…
Solving the Correlation Cluster LP in Sublinear Time
Nairen Cao, Vincent Cohen-Addad, Shi Li +7
Correlation Clustering is a fundamental and widely-studied problem in unsupervised learning and data mining. The input is a graph and the goal is to construct a clustering minimizi…