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...

Celý popis

Uložené v:

Podrobná bibliografia
Vydané v:	Theoretical computer science Ročník 645; s. 41 - 47
Hlavný autor:	Halman, Nir
Médium:	Journal Article
Jazyk:	English
Vydavateľské údaje:	Elsevier B.V 13.09.2016
Predmet:	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
On-line prístup:	Získať plný text
Tagy:	Pridať tag Žiadne tagy, Buďte prvý, kto otaguje tento záznam!

Buďte prvý, kto okomentuje tento záznam!