Pages that link to "Item:Q699820"
From MaRDI portal
The following pages link to The fully polynomial approximation algorithm for the 0-1 knapsack problem (Q699820):
Displaying 9 items.
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- A new fully polynomial time approximation scheme for the Knapsack problem (Q1304384) (← links)
- A faster FPTAS for the unbounded knapsack problem (Q1678097) (← links)
- Approximation algorithms for fractional knapsack problems (Q1866996) (← links)
- A deterministic polynomial-time approximation scheme for counting knapsack solutions (Q2903521) (← links)
- (Q4400850) (← links)
- (Q4636439) (← links)
- (Q5240419) (← links)
- Pseudo-polynomial algorithms for solving the knapsack problem with dependencies between items (Q6106591) (← links)