Pages that link to "Item:Q4313818"
From MaRDI portal
The following pages link to A Fast Approximation Algorithm For The Subset-Sum Problem (Q4313818):
Displaying 7 items.
- An optimization algorithm for the clearing of interbank payments (Q819066) (← links)
- Worst-case analysis of an approximation scheme for the subset-sum problem (Q1089266) (← links)
- An efficient fully polynomial approximation scheme for the Subset-Sum problem. (Q1400576) (← links)
- Constant time approximation scheme for largest well predicted subset (Q2377379) (← links)
- Approximability of the Subset Sum Reconfiguration Problem (Q3010386) (← links)
- Faster Space-Efficient Algorithms for Subset Sum, $k$-Sum, and Related Problems (Q4687248) (← links)
- Faster Pseudopolynomial Time Algorithms for Subset Sum (Q4972686) (← links)