7 citations · 7 across the 3 of their papers we have counts for
4 papers
Undirected 3-Fault Replacement Path in Nearly Cubic Time
Shucheng Chi, Ran Duan, Benyu Wang +1
Given a graph and two vertices , the -fault replacement path (FRP) problem computes for every set of edges where , the distance from to…
Faster Min-Plus Product for Monotone Instances
Shucheng Chi, Ran Duan, Tianle Xie +1
In this paper, we show that the time complexity of monotone min-plus product of two matrices is , where is the f…
Faster Algorithms for Bounded-Difference Min-Plus Product
Shucheng Chi, Ran Duan, Tianle Xie
Min-plus product of two matrices is a fundamental problem in algorithm research. It is known to be equivalent to APSP, and in general it has no truly subcubic algorithm…
A Provably Efficient Algorithm for Linear Markov Decision Process with Low Switching Cost
Minbo Gao, Tianle Xie, Simon S. Du +1
Many real-world applications, such as those in medical domains, recommendation systems, etc, can be formulated as large state space reinforcement learning problems with only a smal…