Oscar H. Ibarra
- 1 COOK, S.A. The complexity of theorem proving procedures. Conf. Record of Third ACM Syrup on Theory of Computing, 1970, pp. 151-158. Google Scholar
- 2 HoaowITz, E., XNV SAHNL S. Computing partitions with applications to the knapsack problem J ACM 21, 2 (April 1974), 277-292 Google Scholar
- 3 INGARGIOLA, G. P , AND KORSH, J F. A reduction algorithm for zero-one single knapsack problems. Manag. Sc, 20 (1973), 460--463.Google Scholar
- 4 JOHNSON, D. Approximation algorithms for combinatorial problems Proc. of the Fifth Annual ACM Syrup on Theory of Computing, 1973, pp 38--49 Google Scholar
- 5 KARP, R. Reducibility among combinatorial problems. In Complexity of Computer Computations, R. E. Mdler and J. W. Thatcher, Eds, Plenum Press, N. Y., 1972, pp 85-104Google Scholar
- 6 KOLESXR, P. J A branch and bound algorithm for the knapsack problem Manag ScI lS (1967), 723-735Google Scholar
- 7 NEMHAUSER, G L., AND GARFINKEL, R. Integer Programming Wiley, New York, 1972.Google Scholar
- 8 NEMHAUSER, G. L., AND ULLMAN, Z Discrete dynamic programming and capital allocation Manag. 8ci 15 (1969), 494-505.Google Scholar
- 9 SAHNI, S Some related problems from network flows, game theory, and integer programming Proc of the 13th Annual IEEE Symp on Switching and Automata Theory, 1972, pp 130--138Google Scholar
- 10 SAHNI, S. Approximate algorithms for the 0/1 knapsack problem J. ACM 22, 1 (Jan 1975), 115-124 Google Scholar
- 11 SAHNI, S., AND GONZALES, T. P-complete problems and approximate solutmns Comput. Sci Teeh. Rep. 74-5, U. of Minnesota, Minneapolis, Minn., 1974.Google Scholar
Index Terms
- Fast Approximation Algorithms for the Knapsack and Sum of Subset Problems
Recommendations
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
In this paper we study the (in)approximability of two distance-based relaxed variants of the maximum clique problem (Max Clique), named Max d-Clique and Max d-Club: A d-clique in a graph $$G = (V, E)$$G=(V,E) is a subset $$S\subseteq V$$S⊆V of vertices ...
Optimal Approximation Algorithms for Maximum Distance-Bounded Subgraph Problems
COCOA 2015: Proceedings of the 9th International Conference on Combinatorial Optimization and Applications - Volume 9486A d-clique in a graph $$G = V, E$$G=V,E is a subset $$S\subseteq V$$S⊆V of vertices such that for pairs of vertices $$u, v\in S$$u,v∈S, the distance between u and v is at most d in G. A d-club in a graph $$G = V, E$$G=V,E is a subset $$S'\subseteq V$$S'⊆...
Structural Approach to Subset Sum Problems
We discuss results obtained jointly with Van Vu on the length of arithmetic progressions in $$\ell $$ℓ-fold sumsets of the form $$\begin{aligned} \ell \mathcal {A}=\{a_1+\dots +a_\ell ~|~a_i\in \mathcal {A}\} \end{aligned}$$ℓA={a1+ź+aℓ|aiźA}and $$\begin{...
Comments