15 citations · 58 across the 17 of their papers we have counts for
4 papers · 1 filter
Solving Knapsack with Small Items via L0-Proximity
Ce Jin
We study pseudo-polynomial time algorithms for the fundamental \emph{0-1 Knapsack} problem. In terms of and , previous algorithms for 0-1 Knapsack have cubic time com…
0-1 Knapsack in Nearly Quadratic Time
Ce Jin
We study pseudo-polynomial time algorithms for the fundamental \emph{0-1 Knapsack} problem. Recent research interest has focused on its fine-grained complexity with respect to the…
An Efficient Algorithm for All-Pairs Bounded Edge Connectivity
Shyan Akmal, Ce Jin
Our work concerns algorithms for an unweighted variant of Maximum Flow. In the All-Pairs Connectivity (APC) problem, we are given a graph on vertices and edges, and are…
Approximating Knapsack and Partition via Dense Subset Sums
Mingyang Deng, Ce Jin, Xiao Mao
Knapsack and Partition are two important additive problems whose fine-grained complexities in the -approximation setting are not yet settled. In this work, we make…