Conference paper
True 3-D displays for avionics and mission crewstations
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
In this paper we construct approximate algorithms for the following problems: integer multiple-choice knapsack problem, binary multiple-choice knapsack problem and multi-dimensional knapsack problem. The main result can be described as follows: for every ε 0 one can construct a polynomial-time algorithm for each of the above problems such that the ratio of the value of the objective function by this algorithm and the optimal value is bounded below by 1 - ε. © 1976.
Elizabeth A. Sholler, Frederick M. Meyer, et al.
SPIE AeroSense 1997
Ohad Shamir, Sivan Sabato, et al.
Theoretical Computer Science
Apostol Natsev, Alexander Haubold, et al.
MMSP 2007
P.C. Yue, C.K. Wong
Journal of the ACM