A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2019; you can also visit the original URL.
The file type is application/pdf
.
A Subquadratic Approximation Scheme for Partition
[article]
2018
arXiv
pre-print
The subject of this paper is the time complexity of approximating Knapsack, Subset Sum, Partition, and some other related problems. The main result is an O(n+1/ε^5/3) time randomized FPTAS for Partition, which is derived from a certain relaxed form of a randomized FPTAS for Subset Sum. To the best of our knowledge, this is the first NP-hard problem that has been shown to admit a subquadratic time approximation scheme, i.e., one with time complexity of O((n+1/ε)^2-δ) for some δ>0. To put these
arXiv:1804.02269v1
fatcat:4oapl5qvxzbcro2ylgkmixzm4u