Pages that link to "Item:Q506160"
From MaRDI portal
The following pages link to Approximation schemes for the parametric knapsack problem (Q506160):
Displaying 11 items.
- A stronger lower bound on parametric minimum spanning trees (Q832875) (← links)
- Approximating the 3-period incremental knapsack problem (Q1711662) (← links)
- The binary knapsack problem with qualitative levels (Q2029032) (← links)
- An approximation algorithm for a general class of multi-parametric optimization problems (Q2082173) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- An approximation algorithm for a general class of parametric optimization problems (Q2156299) (← links)
- An FPTAS for the knapsack problem with parametric weights (Q2294221) (← links)
- An FPTAS for the parametric knapsack problem (Q2361499) (← links)
- On approximating the incremental knapsack problem (Q2422736) (← links)
- Max-max, max-min, min-max and min-min knapsack problems with a parametric constraint (Q6097849) (← links)
- A stronger lower bound on parametric minimum spanning trees (Q6103526) (← links)
