Pages that link to "Item:Q2417856"
From MaRDI portal
The following pages link to Faster FPTASes for counting and random generation of knapsack solutions (Q2417856):
Displaying 7 items.
- A deterministic fully polynomial time approximation scheme for counting integer knapsack solutions made easy (Q306252) (← links)
- An FPTAS for the volume computation of 0-1 knapsack polytopes based on approximate convolution (Q727987) (← links)
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Probability estimation via policy restrictions, convexification, and approximate sampling (Q2097639) (← links)
- Automatic Generation of FPTASes for Stochastic Monotone Dynamic Programs Made Easier (Q5013571) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)
- On computing probabilistic abductive explanations (Q6116531) (← links)