Daniel M. Bikel, Vittorio Castelli
ACL 2008
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.
Daniel M. Bikel, Vittorio Castelli
ACL 2008
Thomas R. Puzak, A. Hartstein, et al.
CF 2007
S.M. Sadjadi, S. Chen, et al.
TAPIA 2009
S.F. Fan, W.B. Yun, et al.
Proceedings of SPIE 1989