Approximating Knapsack and Partition via Dense Subset Sums

01/23/2023
by   Mingyang Deng, et al.
0

Knapsack and Partition are two important additive problems whose fine-grained complexities in the (1-ε)-approximation setting are not yet settled. In this work, we make progress on both problems by giving improved algorithms. - Knapsack can be (1 - ε)-approximated in Õ(n + (1/ε) ^ 2.2 ) time, improving the previous Õ(n + (1/ε) ^ 2.25 ) by Jin (ICALP'19). There is a known conditional lower bound of (n+ε)^2-o(1) based on (min,+)-convolution hypothesis. - Partition can be (1 - ε)-approximated in Õ(n + (1/ε) ^ 1.25 ) time, improving the previous Õ(n + (1/ε) ^ 1.5 ) by Bringmann and Nakos (SODA'21). There is a known conditional lower bound of (1/ε)^1-o(1) based on Strong Exponential Time Hypothesis. Both of our new algorithms apply the additive combinatorial results on dense subset sums by Galil and Margalit (SICOMP'91), Bringmann and Wellnitz (SODA'21). Such techniques have not been explored in the context of Knapsack prior to our work. In addition, we design several new methods to speed up the divide-and-conquer steps which naturally arise in solving additive problems.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
04/06/2018

Subquadratic Approximation Scheme for Partition

The subject of this paper is the time complexity of approximating Knapsa...
research
08/08/2023

0-1 Knapsack in Nearly Quadratic Time

We study pseudo-polynomial time algorithms for the fundamental 0-1 Knaps...
research
10/18/2020

On Near-Linear-Time Algorithms for Dense Subset Sum

In the Subset Sum problem we are given a set of n positive integers X an...
research
08/16/2023

Approximating Min-Diameter: Standard and Bichromatic

The min-diameter of a directed graph G is a measure of the largest dista...
research
08/14/2023

(1-ε)-Approximation of Knapsack in Nearly Quadratic Time

Knapsack is one of the most fundamental problems in theoretical computer...
research
09/12/2022

An Improved Lower Bound for Matroid Intersection Prophet Inequalities

We consider prophet inequalities subject to feasibility constraints that...
research
07/18/2023

Solving Knapsack with Small Items via L0-Proximity

We study pseudo-polynomial time algorithms for the fundamental 0-1 Knaps...

Please sign up or login with your details

Forgot password? Click here to reset