{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,23]],"date-time":"2024-09-23T03:44:28Z","timestamp":1727063068055},"publisher-location":"Berlin, Heidelberg","reference-count":7,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540647812"},{"type":"electronic","value":"9783540686811"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0055069","type":"book-chapter","created":{"date-parts":[[2006,8,1]],"date-time":"2006-08-01T08:08:05Z","timestamp":1154419685000},"page":"387-396","source":"Crossref","is-referenced-by-count":3,"title":["Efficient approximation algorithms for the subset-sums equality problem"],"prefix":"10.1007","author":[{"given":"Cristina","family":"Bazgan","sequence":"first","affiliation":[]},{"given":"Miklos","family":"Santha","sequence":"additional","affiliation":[]},{"given":"Zsolt","family":"Tuza","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,26]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"276","DOI":"10.1007\/BFb0028567","volume":"1373","author":"C. Bazgan","year":"1998","unstructured":"C. Bazgan, M. Santha and Zs. Tuza, On the approximation of finding a(nother) Hamiltonian cycle in cubic Hamiltonian graphs, 15th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, Vol. 1373 (1998), 276\u2013286.","journal-title":"Lecture Notes in Computer Science"},{"issue":"4","key":"34_CR2","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1145\/321906.321909","volume":"22","author":"O. H. Ibarra","year":"1975","unstructured":"O. H. Ibarra and C. E. Kim, Fast approximation algorithms for the Knapsack and Sum of Subset problems, J. ACM, 22:4 (1975), 463\u2013468.","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"R. M. Karp, Reducibility among combinatorial problems, in: Complexity of Computer Computations (R. E. Miller and J. W. Thatcher, eds.) (1972), 85\u2013103.","key":"34_CR3","DOI":"10.1007\/978-1-4684-2001-2_9"},{"doi-asserted-by":"crossref","unstructured":"H. Kellerer, R. Mansini, U. Pferschy and M. G. Speranza, An efficient fully polynomial approximation scheme for the Subset-Sum problem, manuscript, 1997.","key":"34_CR4","DOI":"10.1007\/3-540-63890-3_42"},{"key":"34_CR5","doi-asserted-by":"publisher","first-page":"317","DOI":"10.1016\/0304-3975(91)90200-L","volume":"81","author":"N. Megiddo","year":"1991","unstructured":"N. Megiddo and C. Papadimitriou, On total functions, existence theorems and computational complexity, Theoretical Computer Science, 81 (1991), 317\u2013324.","journal-title":"Theoretical Computer Science"},{"key":"34_CR6","doi-asserted-by":"publisher","first-page":"498","DOI":"10.1016\/S0022-0000(05)80063-7","volume":"48","author":"C. Papadimitriou","year":"1994","unstructured":"C. Papadimitriou, On the complexity of the parity argument and other inefficient proofs of existence, Journal of Computer and System Sciences 48 (1994), 498\u2013532.","journal-title":"Journal of Computer and System Sciences"},{"key":"34_CR7","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1016\/0020-0190(92)90226-L","volume":"42","author":"G. J. Woeginger","year":"1992","unstructured":"G. J. Woeginger and Z. Yu, On the equal-subset-sum problem, Information Processing Letters 42 (1992), 299\u2013302.","journal-title":"Information Processing Letters"}],"container-title":["Lecture Notes in Computer Science","Automata, Languages and Programming"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0055069","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,20]],"date-time":"2019-04-20T08:19:09Z","timestamp":1555748349000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0055069"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540647812","9783540686811"],"references-count":7,"URL":"https:\/\/doi.org\/10.1007\/bfb0055069","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}