A Subquadratic Approximation Scheme for Partition

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 \(\widetilde{O}(n+1/\varepsilon^{5/3})\) time randomized FPTAS for Partition, which is derived from a certain relaxed form of a randomized FPTAS f...

Full description

Bibliographic Details

Published in:	arXiv.org
Main Authors:	Mucha, Marcin, Węgrzycki, Karol, Włodarczyk, Michał
Format:	Paper
Language:	English
Published:	Ithaca Cornell University Library, arXiv.org 06.05.2019
Subjects:	Algorithms Approximation Combinatorial analysis Complexity Convolution Lower bounds Mathematical analysis Partitions Polynomials Randomization
ISSN:	2331-8422
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!