Faster FPTASes for Counting and Random Generation of Knapsack Solutions

DOI10.1007/978-3-662-44777-2_63zbMath1425.68459arXiv1307.2347OpenAlexW2281724276MaRDI QIDQ2921460

Romeo Rizzi, Alexandru I. Tomescu

Publication date: 8 October 2014

Published in: Algorithms - ESA 2014 (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1307.2347

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Dynamic programming (90C39) Approximation algorithms (68W25)

Related Items

A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy ⋮ Faster FPTASes for counting and random generation of knapsack solutions ⋮ A Faster FPTAS for #Knapsack ⋮ A faster FPTAS for counting two-rowed contingency tables

This page was built for publication: Faster FPTASes for Counting and Random Generation of Knapsack Solutions