![]() | ![]() |
1998 | ||
---|---|---|
2 | EE | George Gens, Eugene Levner: An Approximate Binary Search Algorithm for the Multiple-Choice Knapsack Problem. Inf. Process. Lett. 67(5): 261-265 (1998) |
1979 | ||
1 | George Gens, Eugene Levner: Computational Complexity of Approximation Algorithms for Combinatorial Problems. MFCS 1979: 292-300 |
1 | Eugene Levner | [1] [2] |