A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy

Given n elements with nonnegative integer weights w=(w1,…,wn), an integer capacity C and positive integer ranges u=(u1,…,un), we consider the counting version of the classic integer knapsack problem: find the number of distinct multisets whose weights add up to at most C. We give a deterministic alg...

Full description

Saved in:

Bibliographic Details
Published in:	Theoretical computer science Vol. 645; pp. 41 - 47
Main Author:	Halman, Nir
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 13.09.2016
Subjects:	Algorithms Approximate counting Approximation Binding Binding constraints Dynamic programming Estimates Integer knapsack Integers K-approximating sets and functions Mathematical analysis Mathematical models Polynomials Integer knapsack Dynamic programming Binding constraints K-approximating sets and functions Approximate counting
ISSN:	0304-3975, 1879-2294
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Be the first to leave a comment!