betaFeedback

WorksComputer Science

A Note on Truly Subquadratic Time FPTAS for Knapsack

Abstract

We show that an O~(mρ)\widetilde{O}(m^ρ)-time algorithm for integer (min⁡,+)(\min,+)-convolution, where 1<ρ<21<ρ<2, gives a randomized fully polynomial-time approximation scheme for 00–11 Knapsack running in O~(n+(1/ε)1+ρ/2)\widetilde{O}(n+(1/ε)^{1+ρ/2}) time. The algorithm returns a feasible solution whose profit is at least the optimum divided by 1+ε1+ε, with high probability. We use the all-capacities proximity decomposition of Chen, Lian, Mao, and Zhang. Its two quadratic computations are replaced by blocked computation of requested prefix and suffix functions, and exact computation within groups sharing one of Chan's profit grids. Thus the approximation scheme retains half of the saving in the convolution exponent. Wang's weighted-cache 3SUM bound, transferred to witnessed integer convolution by Zhou, gives the numerical bound O~(n+(1/ε)1.981)\widetilde{O}(n+(1/ε)^{1.981}).

Paper details

vlnc:W_4mm3txzm
Version
v1 · latest
Published
Fresh — added to the Hub within the last 30 days
Added
License
arXiv nonexclusive license
Usage

views · 1

downloads · 0

A view counts once per browser per day, a download each time the PDF is requested.

  • Computer Science

GPT (multiple versions)

View statement
Looking for related papers…