{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T13:12:50Z","timestamp":1751548370479},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"4","license":[{"start":{"date-parts":[[1992,2,1]],"date-time":"1992-02-01T00:00:00Z","timestamp":696902400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Supercomput"],"published-print":{"date-parts":[[1992,2]]},"DOI":"10.1007\/bf00127952","type":"journal-article","created":{"date-parts":[[2004,11,2]],"date-time":"2004-11-02T17:58:33Z","timestamp":1099418313000},"page":"331-345","source":"Crossref","is-referenced-by-count":11,"title":["Parallel and serial heuristics for the minimum set cover problem"],"prefix":"10.1007","volume":"5","author":[{"given":"Sreejit","family":"Chakravarty","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ajay","family":"Shekhawat","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","unstructured":"Berger, B., Rompel, J., and Shor, P.W. 1989. Efficient NC algorithms for set cover with applications to learning and geometry. IEEE Symp. FOCS, pp. 54?59.","DOI":"10.1109\/SFCS.1989.63455"},{"issue":"6","key":"CR2","doi-asserted-by":"crossref","first-page":"865","DOI":"10.1109\/12.24296","volume":"38","author":"S. Chakravarty","year":"1989","unstructured":"Chakravarty, S., Hunt III, H.B., Rosenkrantz, J., and Ravi, S.S. 1989. Complexity of generating minimum test sets for PLAs and monotone combinatorial circuits. IEEE Trans. Comps., 38, 6 (June), 865?869.","journal-title":"IEEE Trans. Comps."},{"issue":"3","key":"CR3","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chvatal","year":"1979","unstructured":"Chvatal, V. 1979. A greedy heuristic for the set-covering problem. Math. Op. Res., 4, 3 (Aug.), 233?235.","journal-title":"Math. Op. Res."},{"issue":"4","key":"CR4","doi-asserted-by":"crossref","first-page":"770","DOI":"10.1137\/0217049","volume":"17","author":"R.J. Cole","year":"1988","unstructured":"Cole, R.J. 1988. Parallel merge sort. SIAM J. Computing, 17, 4 (Aug.), 770?785.","journal-title":"SIAM J. Computing"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S. 1974. Approximation algorithms for combinatorial problems. J. Comp. and Sys. Sci., 9: 256?278.","journal-title":"J. Comp. and Sys. Sci."},{"key":"CR6","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"D.S. Johnson","year":"1979","unstructured":"Johnson, D.S., and Garey, G. 1979. Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York."},{"key":"CR7","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","volume":"13","author":"L. Lovasz","year":"1975","unstructured":"Lovasz, L. 1975. On the ratio of optimal integral and fractional covers. Discrete Math., 13: 383?390.","journal-title":"Discrete Math."},{"issue":"8","key":"CR8","doi-asserted-by":"crossref","first-page":"781","DOI":"10.1002\/j.1097-024X.1986.tb00009.x","volume":"16","author":"P. Schneck","year":"1986","unstructured":"Schneck, P. 1986. Superlinear speedup and the halting problem. Software?Practice and Experience, 16, 8 (Aug.), 781?782.","journal-title":"Software?Practice and Experience"}],"container-title":["The Journal of Supercomputing"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00127952.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00127952\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00127952","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,4,29]],"date-time":"2023-04-29T21:45:28Z","timestamp":1682804728000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00127952"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1992,2]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1992,2]]}},"alternative-id":["BF00127952"],"URL":"https:\/\/doi.org\/10.1007\/bf00127952","relation":{},"ISSN":["0920-8542","1573-0484"],"issn-type":[{"value":"0920-8542","type":"print"},{"value":"1573-0484","type":"electronic"}],"subject":[],"published":{"date-parts":[[1992,2]]}}}