15 citations · 58 across the 17 of their papers we have counts for
Showing 2019Show all
2 papers · 1 filter
cs.DS2019
Faster Algorithms for All Pairs Non-decreasing Paths Problem
Ran Duan, Ce Jin, Hongxun Wu
In this paper, we present an improved algorithm for the All Pairs Non-decreasing Paths (APNP) problem on weighted simple digraphs, which has running time $\tilde{O}(n^{\frac{3 + ω}…
cs.DS2019★ 14 cited
An Improved FPTAS for 0-1 Knapsack
Ce Jin
The 0-1 knapsack problem is an important NP-hard problem that admits fully polynomial-time approximation schemes (FPTASs). Previously the fastest FPTAS by Chan (2018) with approxim…