{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:24Z","timestamp":1725662844115},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108283"},{"type":"electronic","value":"9783540387169"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10828-9_55","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:26:35Z","timestamp":1330190795000},"page":"76-87","source":"Crossref","is-referenced-by-count":2,"title":["Full approximability of a class of problems over power sets"],"prefix":"10.1007","author":[{"given":"G.","family":"Ausiello","sequence":"first","affiliation":[]},{"given":"A. Marchetti","family":"Spaccamela","sequence":"additional","affiliation":[]},{"given":"M.","family":"Protasi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"G.AUSIELLO, A.MARCHETTI SPACCAMELA, M.PROTASI: Combinatorial problems over power sets, Calcolo, Vol. 16, n. 4, 1979.","DOI":"10.1007\/BF02576644"},{"key":"5_CR2","unstructured":"M.R.GAREY, D.S.JOHNSON: Computers and intractability. A guide to the theory of NP-completeness, Freeman and Company, 1979."},{"key":"5_CR3","unstructured":"B.KORTE, R.SCHRADER: On the existence of fast approximation schemes, Tech. Rep. 80163-OR, University of Bonn."},{"key":"5_CR4","doi-asserted-by":"crossref","unstructured":"O.H.IBARRA, C.E.KIM: Fast approximation algorithms for the knapsack and sum subset problems, J. ACM Vol. 22, n.4, 1975.","DOI":"10.1145\/321906.321909"},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"E.L.LAWLER: Fast approximation algorithms for knapsack problems, Proc. 18th FOCS, Long Beach, 1977.","DOI":"10.1109\/SFCS.1977.11"},{"key":"5_CR6","series-title":"Tech. Rep.","volume-title":"General approximation algorithms for some arithmetical combinatorial problems","author":"S. Moran","year":"1978","unstructured":"S. MORAN: General approximation algorithms for some arithmetical combinatorial problems, Tech. Rep. 140, Technion, Haifa, 1978."},{"key":"5_CR7","unstructured":"A.PAZ, S.MORAN: NP-optimization problems and their approximations, Proc. 4th ICALP, Turku, 1977."},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"S. SAHNI: Approximate algorithms for the 0\/1 knapsack problem, J ACM Vol. 22, n. 1, 1975.","DOI":"10.1145\/321864.321873"}],"container-title":["Lecture Notes in Computer Science","CAAP '81"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10828-9_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:39:01Z","timestamp":1619555941000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10828-9_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108283","9783540387169"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-10828-9_55","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}