(1 − 𝜀)-Approximation of Knapsack in Nearly Quadratic Time
X Mao - Proceedings of the 56th Annual ACM Symposium on …, 2024 - dl.acm.org
Knapsack is one of the most fundamental problems in theoretical computer science. In the
(1− є)-approximation setting, although there is a fine-grained lower bound of (n+ 1/є) 2− o …
(1− є)-approximation setting, although there is a fine-grained lower bound of (n+ 1/є) 2− o …
-Approximation of Knapsack in Nearly Quadratic Time
X Mao - arxiv preprint arxiv:2308.07004, 2023 - arxiv.org
Knapsack is one of the most fundamental problems in theoretical computer science. In the
$(1-\epsilon) $-approximation setting, although there is a fine-grained lower bound of $(n+ …
$(1-\epsilon) $-approximation setting, although there is a fine-grained lower bound of $(n+ …