{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,2]],"date-time":"2026-06-02T01:16:46Z","timestamp":1780363006392,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":3,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540676904","type":"print"},{"value":"9783540449850","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2000]]},"DOI":"10.1007\/3-540-44985-x_19","type":"book-chapter","created":{"date-parts":[[2007,11,13]],"date-time":"2007-11-13T20:17:33Z","timestamp":1194985053000},"page":"214-219","source":"Crossref","is-referenced-by-count":39,"title":["A d\/2 Approximation for Maximum Weight Independent Set in d-Claw Free Graphs"],"prefix":"10.1007","author":[{"given":"Piotr","family":"Berman","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2002,3,15]]},"reference":[{"key":"19_CR1","series-title":"Lect Notes Comput Sci","doi-asserted-by":"crossref","first-page":"506","DOI":"10.1007\/3-540-60220-8_89","volume-title":"WADS 1995","author":"V. Bafna","year":"1995","unstructured":"V. Bafna, B. Narayana and R. Ravi, Non-overlapping local alignments (weighted independent sets of axis parallel rectangles, WADS 1995, Springer-Verlag LNCS 955:506\u2013517, to appear in Disc. Appl. Math."},{"key":"19_CR2","unstructured":"B. Chandra and M. M. Halld\u00f3rsson, Greedy local improvement and weighted packing approximation, SODA 1999."},{"issue":"1","key":"19_CR3","doi-asserted-by":"crossref","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C. A. Hurkens","year":"1989","unstructured":"C. A. Hurkens and A. Schrijver, One the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio heuristics for packing problems, SIAM J. Discr. Math. 2(1):68\u201372, Feb. 1989.","journal-title":"SIAM J. Discr. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithm Theory - SWAT 2000"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44985-X_19","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,3]],"date-time":"2019-03-03T02:24:35Z","timestamp":1551579875000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44985-X_19"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000]]},"ISBN":["9783540676904","9783540449850"],"references-count":3,"URL":"https:\/\/doi.org\/10.1007\/3-540-44985-x_19","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2000]]}}}