The following pages link to (Q3912008):
Displaying 6 items.
- Approximation algorithms for the m-dimensional 0-1 knapsack problem: Worst-case and probabilistic analyses (Q789319) (← links)
- Completeness in approximation classes (Q811119) (← links)
- On different approximation criteria for subset product problems (Q1076608) (← links)
- A class of generalized greedy algorithms for the multi-knapsack problem (Q1803680) (← links)
- A fully polynomial approximation scheme for the total tardiness problem (Q1839195) (← links)
- The computational complexity of antimatroid properties (Q5933438) (← links)
