Pages that link to "Item:Q1168896"
From MaRDI portal
The following pages link to Probabilistic analysis of the subset-sum problem (Q1168896):
Displayed 7 items.
- Approximation schemes for the subset-sum problem: Survey and experimental analysis (Q1069445) (← links)
- The bounded subset sum problem is almost everywhere randomly decidable in O(n) (Q1083370) (← links)
- Average-case performance analysis of an approximation algorithm for maximum subset sum using recurrence relations (Q1125006) (← links)
- Probabilistic properties of the dual structure of the multidimensional knapsack problem and fast statistically efficient algorithms (Q1338142) (← links)
- Average-case performance of rollout algorithms for knapsack problems (Q2349849) (← links)
- The average quality of greedy-algorithms for the Subset-Sum-Maximization Problem (Q3354469) (← links)
- Random knapsack in expected polynomial time (Q5917572) (← links)