{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T00:21:04Z","timestamp":1725495664068},"publisher-location":"Berlin, Heidelberg","reference-count":0,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540642015"},{"type":"electronic","value":"9783540697015"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0053020","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T00:57:39Z","timestamp":1149641859000},"page":"249-262","source":"Crossref","is-referenced-by-count":0,"title":["The hardness of approximating set cover"],"prefix":"10.1007","author":[{"given":"Alexander","family":"Wolff","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2006,5,20]]},"container-title":["Lecture Notes in Computer Science","Lectures on Proof Verification and Approximation Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0053020","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2014,8,26]],"date-time":"2014-08-26T18:18:01Z","timestamp":1409077081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0053020"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540642015","9783540697015"],"references-count":0,"URL":"https:\/\/doi.org\/10.1007\/bfb0053020","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]}}}