Search Results - "$K$-approximating sets AND functions"

A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy by Halman, Nir

“…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…”
Get full text