Pages that link to "Item:Q1675574"
From MaRDI portal
The following pages link to A new fully polynomial time approximation scheme for the interval subset sum problem (Q1675574):
Displaying 4 items.
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- Knapsack problems -- an overview of recent advances. I: Single knapsack problems (Q2147010) (← links)
- A Subexponential Parameterized Algorithm for Proper Interval Completion (Q5899484) (← links)
- Learning-augmented algorithms for online subset sum (Q6064057) (← links)