{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,10]],"date-time":"2024-09-10T14:25:19Z","timestamp":1725978319991},"edition-number":"1","reference-count":1,"publisher":"Chapman and Hall\/CRC","isbn-type":[{"type":"electronic","value":"9781351236423"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,5,15]]},"DOI":"10.1201\/9781351236423-14","type":"book-chapter","created":{"date-parts":[[2019,7,17]],"date-time":"2019-07-17T10:55:50Z","timestamp":1563360950000},"page":"243-258","source":"Crossref","is-referenced-by-count":1,"title":["Reductions That Preserve Approximability"],"prefix":"10.1201","author":[{"given":"Giorgio","family":"Ausiello","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"301","reference":[{"key":"ref14","doi-asserted-by":"crossref","unstructured":"1 Cook, S.A. , The complexity of theorem-proving procedures, in Proceedings of Third ACM Symposium on Theory of Computing, p. 151, 1971.","DOI":"10.1145\/800157.805047"}],"container-title":["Handbook of Approximation Algorithms and Metaheuristics, Second Edition"],"original-title":[],"language":"en","deposited":{"date-parts":[[2021,4,4]],"date-time":"2021-04-04T14:06:22Z","timestamp":1617545182000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.taylorfrancis.com\/books\/9781351236416\/chapters\/10.1201\/9781351236423-14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,5,15]]},"ISBN":["9781351236423"],"references-count":1,"URL":"https:\/\/doi.org\/10.1201\/9781351236423-14","relation":{},"subject":[],"published":{"date-parts":[[2018,5,15]]}}}