Pages that link to "Item:Q1608313"
From MaRDI portal
The following pages link to Efficient approximation algorithms for the subset-sums equality problem. (Q1608313):
Displaying 9 items.
- On the equal-subset-sum problem (Q1198083) (← links)
- A faster FPTAS for the subset-sums ratio problem (Q1791024) (← links)
- Faster algorithms for \(k\)-subset sum and variations (Q2105266) (← links)
- Approximation schemes for subset-sums ratio problems (Q2167894) (← links)
- Approximating subset sum ratio via subset sum computations (Q2169941) (← links)
- Simple FPTAS for the subset-sums ratio problem (Q2445243) (← links)
- Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
- Fundamentals of Computation Theory (Q5900789) (← links)
- Approximating subset sum ratio via partition computations (Q6541032) (← links)