activity
20132026
most citedOn the optimality of approximation schemes for the classical scheduling problem

22 citations · 43 across the 15 of their papers we have counts for

collaborators
Showing 2023Show all

2 papers · 1 filter

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…