{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,30]],"date-time":"2025-09-30T04:08:12Z","timestamp":1759205292800},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1982,1,1]],"date-time":"1982-01-01T00:00:00Z","timestamp":378691200000},"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":11520,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Mathematics"],"published-print":{"date-parts":[[1982,1]]},"DOI":"10.1016\/0012-365x(82)90169-8","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:45:00Z","timestamp":1027655100000},"page":"65-71","source":"Crossref","is-referenced-by-count":9,"title":["A polynomial algorithm for the minimum weighted clique cover problem on claw-free perfect graphs"],"prefix":"10.1016","volume":"38","author":[{"given":"Wen-Lian","family":"HSU","sequence":"first","affiliation":[]},{"given":"George L.","family":"Nemhauser","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0012-365X(82)90169-8_BIB1","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1016\/0095-8956(75)90041-6","article-title":"On certain polytopes associated with graphs","volume":"18","author":"Chv\u00e1tal","year":"1972","journal-title":"J. Combinatorial Theory (B)"},{"key":"10.1016\/0012-365X(82)90169-8_BIB2","series-title":"Mathematical Programming","first-page":"69","article-title":"On the perfect graph theorem","author":"Fulkerson","year":"1973"},{"key":"10.1016\/0012-365X(82)90169-8_BIB3","series-title":"Report No. 80,151","article-title":"The ellipsoid method and its consequences in combinatorial optimization","author":"Gr\u00f6tschel","year":"1980"},{"key":"10.1016\/0012-365X(82)90169-8_BIB4","series-title":"Ph.D. dissertation","article-title":"Efficient algorithms for some packing and covering problems on graphs","author":"Hsu","year":"1980"},{"key":"10.1016\/0012-365X(82)90169-8_BIB5","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1016\/0012-365X(81)90218-1","article-title":"Algorithms for minimum coverings by cliques and maximum clique in claw-free perfect graphs","volume":"37","author":"Hsu","year":"1981","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(82)90169-8_BIB6","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1016\/0012-365X(72)90006-4","article-title":"Normal hypergraphs and the perfect graph conjecture","volume":"2","author":"Lovasz","year":"1972","journal-title":"Discrete Math."},{"key":"10.1016\/0012-365X(82)90169-8_BIB7","first-page":"212","article-title":"On maximal independent sets of vertices in claw-free graphs","volume":"21","author":"Minty","year":"1980","journal-title":"J. Combinatorial Theory (B)"}],"container-title":["Discrete Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82901698?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0012365X82901698?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T05:51:34Z","timestamp":1555134694000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0012365X82901698"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1982,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1982,1]]}},"alternative-id":["0012365X82901698"],"URL":"https:\/\/doi.org\/10.1016\/0012-365x(82)90169-8","relation":{},"ISSN":["0012-365X"],"issn-type":[{"value":"0012-365X","type":"print"}],"subject":[],"published":{"date-parts":[[1982,1]]}}}