{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,9]],"date-time":"2026-08-09T19:51:45Z","timestamp":1786305105587,"version":"3.56.0"},"reference-count":11,"publisher":"Elsevier BV","issue":"2-3","license":[{"start":{"date-parts":[[2003,3,1]],"date-time":"2003-03-01T00:00:00Z","timestamp":1046476800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3791,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Applied Mathematics"],"published-print":{"date-parts":[[2003,3]]},"DOI":"10.1016\/s0166-218x(02)00205-6","type":"journal-article","created":{"date-parts":[[2002,10,28]],"date-time":"2002-10-28T16:05:14Z","timestamp":1035821114000},"page":"313-322","source":"Crossref","is-referenced-by-count":254,"title":["A note on greedy algorithms for the maximum weighted independent set problem"],"prefix":"10.1016","volume":"126","author":[{"given":"Shuichi","family":"Sakai","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mitsunori","family":"Togasaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Koichi","family":"Yamazaki","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/S0166-218X(02)00205-6_BIB1","series-title":"The Probabilistic Method","author":"Alon","year":"1992"},{"key":"10.1016\/S0166-218X(02)00205-6_BIB2","series-title":"Graphs et Hypergraphs","author":"Berge","year":"1970"},{"key":"10.1016\/S0166-218X(02)00205-6_BIB3","unstructured":"Y. Caro, New results on the independence number, Technical Report, Tel Aviv University, 1979."},{"issue":"1","key":"10.1016\/S0166-218X(02)00205-6_BIB4","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1007\/BF01191201","article-title":"Small transversals in hypergraphs","volume":"12","author":"Chv\u00e1tal","year":"1992","journal-title":"Combinatorica"},{"key":"10.1016\/S0166-218X(02)00205-6_BIB5","first-page":"249","article-title":"On the graph theorem of Tur\u00e1n","volume":"21","author":"Erd\u00f6s","year":"1970","journal-title":"Mat. Lapok"},{"key":"10.1016\/S0166-218X(02)00205-6_BIB6","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/0095-8956(83)90003-5","article-title":"Lower bounds on the independence number in terms of the degrees","volume":"34","author":"Griggs","year":"1983","journal-title":"J. Combin. Theory Ser. B"},{"issue":"1","key":"10.1016\/S0166-218X(02)00205-6_BIB7","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/BF02523693","article-title":"Greed is good: approximating independent sets in sparse and bounded-degree graphs","volume":"18","author":"Halld\u00f3rsson","year":"1997","journal-title":"Algorithmica"},{"key":"10.1016\/S0166-218X(02)00205-6_BIB8","doi-asserted-by":"crossref","first-page":"137","DOI":"10.1016\/0012-365X(92)00057-X","article-title":"Stable set and polynomials","volume":"124","author":"Lov\u00e1sz","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00205-6_BIB9","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/BF01098364","article-title":"The maximum clique problem","volume":"4","author":"Pardalos","year":"1994","journal-title":"J. Global Optimization"},{"key":"10.1016\/S0166-218X(02)00205-6_BIB10","doi-asserted-by":"crossref","first-page":"363","DOI":"10.1016\/0012-365X(93)00102-B","article-title":"A probabilistic lower bound on the independence number of graphs","volume":"132","author":"Selkow","year":"1994","journal-title":"Discrete Math."},{"key":"10.1016\/S0166-218X(02)00205-6_BIB11","unstructured":"V.K. Wei, A lower bound on the stability number of a simple graph, Technical Memorandum No. 81-11217-9, Bell Laboratories, 1981."}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002056?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0166218X02002056?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T14:54:17Z","timestamp":1555167257000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0166218X02002056"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,3]]},"references-count":11,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2003,3]]}},"alternative-id":["S0166218X02002056"],"URL":"https:\/\/doi.org\/10.1016\/s0166-218x(02)00205-6","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[2003,3]]}}}