Pages that link to "Item:Q2921460"
From MaRDI portal
The following pages link to Faster FPTASes for Counting and Random Generation of Knapsack Solutions (Q2921460):
Displaying 5 items.
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← links)
- A faster FPTAS for counting two-rowed contingency tables (Q1983128) (← links)
- Faster FPTASes for counting and random generation of knapsack solutions (Q2417856) (← links)
- A Faster FPTAS for #Knapsack (Q5002742) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)