The following pages link to (Q5240419):
Displaying 9 items.
- Strongly polynomial FPTASes for monotone dynamic programs (Q2088581) (← links)
- Approximation schemes for multiperiod binary knapsack problems (Q2117082) (← links)
- An FPTAS for the \(\varDelta \)-modular multidimensional knapsack problem (Q2117618) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- (Q5091235) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5918631) (← links)
- \(\ell_1\)-sparsity approximation bounds for packing integer programs (Q5918913) (← links)
- A faster FPTAS for knapsack problem with cardinality constraint (Q5970810) (← links)
