4 citations · 9 across the 10 of their papers we have counts for
Showing 2023Show all
3 papers · 1 filter
stat.ME2023★ 2 cited
On Block Cholesky Decomposition for Sparse Inverse Covariance Estimation
Xiaoning Kang, Jiayi Lian, Xinwei Deng
The modified Cholesky decomposition is popular for inverse covariance estimation, but often needs pre-specification on the full information of variable ordering. In this work, we p…
cs.DS2023★ 1 cited
A Nearly Quadratic-Time FPTAS for Knapsack
Lin Chen, Jiayi Lian, Yuchen Mao +1
We investigate the classic Knapsack problem and propose a fully polynomial-time approximation scheme (FPTAS) that runs in time. This improves…
cs.DS2023★ 2 cited
Faster Algorithms for Bounded Knapsack and Bounded Subset Sum Via Fine-Grained Proximity Results
Lin Chen, Jiayi Lian, Yuchen Mao +1
We investigate pseudopolynomial-time algorithms for Bounded Knapsack and Bounded Subset Sum. Recent years have seen a growing interest in settling their fine-grained complexity wit…