This is a preview of subscription content, log in via an institution to check access.
Preview
Unable to display preview. Download preview PDF.
References
G.AUSIELLO, A.MARCHETTI SPACCAMELA, M.PROTASI: Combinatorial problems over power sets, Calcolo, Vol. 16, n. 4, 1979.
M.R.GAREY, D.S.JOHNSON: Computers and intractability. A guide to the theory of NP-completeness, Freeman and Company, 1979.
B.KORTE, R.SCHRADER: On the existence of fast approximation schemes, Tech. Rep. 80163-OR, University of Bonn.
O.H.IBARRA, C.E.KIM: Fast approximation algorithms for the knapsack and sum subset problems, J. ACM Vol. 22, n.4, 1975.
E.L.LAWLER: Fast approximation algorithms for knapsack problems, Proc. 18th FOCS, Long Beach, 1977.
S. MORAN: General approximation algorithms for some arithmetical combinatorial problems, Tech. Rep. 140, Technion, Haifa, 1978.
A.PAZ, S.MORAN: NP-optimization problems and their approximations, Proc. 4th ICALP, Turku, 1977.
S. SAHNI: Approximate algorithms for the 0/1 knapsack problem, J ACM Vol. 22, n. 1, 1975.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1981 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Ausiello, G., Spaccamela, A.M., Protasi, M. (1981). Full approximability of a class of problems over power sets. In: Astesiano, E., Böhm, C. (eds) CAAP '81. CAAP 1981. Lecture Notes in Computer Science, vol 112. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-10828-9_55
Download citation
DOI: https://doi.org/10.1007/3-540-10828-9_55
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-10828-3
Online ISBN: 978-3-540-38716-9
eBook Packages: Springer Book Archive