{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:40:03Z","timestamp":1752378003627,"version":"3.41.2"},"reference-count":6,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,5,1]],"date-time":"1997-05-01T00:00:00Z","timestamp":862444800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Optimization and Applications"],"published-print":{"date-parts":[[1997,5]]},"DOI":"10.1023\/a:1008660812834","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T10:12:40Z","timestamp":1040551960000},"page":"307-324","source":"Crossref","is-referenced-by-count":0,"title":["The Approximability Behaviour  of Some Combinatorial Problems with Respect to the Approximability of a Class  of Maximum Independent Set Problems"],"prefix":"10.1007","volume":"7","author":[{"given":"Marc","family":"Demange","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vangelis Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"125999_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, \"Proof verification and intractability of approximation problems,\" Proc. FOCS, pp. 14\u201323, 1992.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"125999_CR2","unstructured":"M. Bellare, O. Goldreich, and M. Sudan, \"Free bits, and non-approximability-Towards tight results,\" Preliminary version of May 1995."},{"key":"125999_CR3","unstructured":"M. Demange and V. Th. Paschos, \"Exact and approximation results on maximum independent set and minimum vertex covering-Graphs with great stability number,\" manuscript, 1994."},{"key":"125999_CR4","doi-asserted-by":"crossref","unstructured":"M. Demange and V. Th. Paschos, \"Relative hardness of constructive-non-constructive approximation: The case of maximum independent set problem,\" Combinatorics and Computer Science (CCS-95), Brest, France, 1995.","DOI":"10.1007\/3-540-61576-8_83"},{"key":"125999_CR5","volume-title":"A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. Garey and D.S. Johnson, Computers and intractability. A Guide to the Theory of NP-Completeness, W.H. Freeman and Company: San Francisco, 1979."},{"key":"125999_CR6","volume-title":"Combinatorial Optimization: Algorithms and Complexity","author":"C.H. Papadimitriou","year":"1981","unstructured":"C.H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Prentice Hall, New Jersey, 1981."}],"container-title":["Computational Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008660812834.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1008660812834\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1008660812834.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,13]],"date-time":"2025-07-13T03:18:16Z","timestamp":1752376696000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1008660812834"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,5]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,5]]}},"alternative-id":["125999"],"URL":"https:\/\/doi.org\/10.1023\/a:1008660812834","relation":{},"ISSN":["0926-6003","1573-2894"],"issn-type":[{"type":"print","value":"0926-6003"},{"type":"electronic","value":"1573-2894"}],"subject":[],"published":{"date-parts":[[1997,5]]}}}