{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:14:03Z","timestamp":1759637643608,"version":"3.41.0"},"reference-count":8,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1997,6,1]],"date-time":"1997-06-01T00:00:00Z","timestamp":865123200000},"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":["Journal of Combinatorial Optimization"],"published-print":{"date-parts":[[1997,6]]},"DOI":"10.1023\/a:1009755815678","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T22:50:41Z","timestamp":1040597441000},"page":"151-164","source":"Crossref","is-referenced-by-count":6,"title":["Local Optimality and Its Application on Independent Sets for k-claw Free Graphs"],"prefix":"10.1007","volume":"1","author":[{"given":"Gang","family":"Yu","sequence":"first","affiliation":[]},{"given":"Olivier","family":"Goldschmidt","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"129251_CR1","doi-asserted-by":"crossref","unstructured":"S. Arora, C. Lund, R. Motwani, M. Sudan, and M. Szegedy, \u201cProof verification and intractability of approximation problems,\u201d Manuscript,1992.","DOI":"10.1109\/SFCS.1992.267823"},{"key":"129251_CR2","unstructured":"Te. Asano, \u201cDifficulty of the maximum independent set problem on intersection graphs of geometric objects,\u201d Proceedings 6th International Conference on the Theory and Applications of Graphs, Kalamazoo, Michigan, 1990."},{"key":"129251_CR3","unstructured":"M. Garey and D.S. Johnson, Computers and Intractability: A Guide to the Theory of NP-Completeness, Freeman Press, 1979."},{"key":"129251_CR4","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1016\/0166-218X(83)90080-X","volume":"6","author":"D.S. Hochbaum","year":"1983","unstructured":"D.S. Hochbaum, \u201cEfficient bounds for the stable set, vertex cover and set packing problems,\u201d Discrete Appl. Math., vol. 6, pp. 243\u2013254, 1983.","journal-title":"Discrete Appl. Math."},{"key":"129251_CR5","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1016\/0095-8956(80)90074-X","volume":"28","author":"E.L. Lawler","year":"1980","unstructured":"E.L. Lawler, \u201cOn maximal independent sets of vertices in claw-free graphs,\u201d Journal of Combinatorial Theory, Series B, vol. 28, pp. 284\u2013304, 1980.","journal-title":"Journal of Combinatorial Theory"},{"key":"129251_CR6","volume-title":"Combinatorial Optimization\u2013Networks and Matroids","author":"G.J. Minty","year":"1976","unstructured":"G.J. Minty, Combinatorial Optimization\u2013Networks and Matroids, Holt, Rinehart and Winston: New York, 1976."},{"key":"129251_CR7","doi-asserted-by":"crossref","first-page":"425","DOI":"10.1016\/0022-0000(91)90023-X","volume":"43","author":"C.H. Papadimitriou","year":"1991","unstructured":"C.H. Papadimitriou and M. Yannakakis, \u201cOptimization, approximation, and complexity classes,\u201d Journal of Computer and System Sciences, vol. 43, pp. 425\u2013440, 1991.","journal-title":"Journal of Computer and System Sciences"},{"key":"129251_CR8","doi-asserted-by":"crossref","first-page":"737","DOI":"10.1002\/(SICI)1520-6750(199608)43:5<737::AID-NAV9>3.0.CO;2-6","volume":"43","author":"G. Yu","year":"1996","unstructured":"G. Yu and O. Goldschmidt, \u201cOn locally optimal independent sets and vertex covers,\u201d Graduate Program in Operations Research Technical Report Series, OPR92-01, The University of Texas at Austin, 1992, and Naval Research Logistics, vol. 43, pp. 737\u2013748, 1996.","journal-title":"Naval Research Logistics"}],"container-title":["Journal of Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009755815678.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1009755815678\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1009755815678.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,30]],"date-time":"2025-06-30T11:14:11Z","timestamp":1751282051000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1009755815678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,6]]},"references-count":8,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1997,6]]}},"alternative-id":["129251"],"URL":"https:\/\/doi.org\/10.1023\/a:1009755815678","relation":{},"ISSN":["1382-6905","1573-2886"],"issn-type":[{"type":"print","value":"1382-6905"},{"type":"electronic","value":"1573-2886"}],"subject":[],"published":{"date-parts":[[1997,6]]}}}