{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,8,19]],"date-time":"2023-08-19T05:06:02Z","timestamp":1692421562169},"reference-count":6,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1993,2,1]],"date-time":"1993-02-01T00:00:00Z","timestamp":728524800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Operations Research Letters"],"published-print":{"date-parts":[[1993,2]]},"DOI":"10.1016\/0167-6377(93)90083-s","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T18:40:45Z","timestamp":1056998445000},"page":"43-44","source":"Crossref","is-referenced-by-count":2,"title":["An optimal group testing algorithm on k disjoint sets"],"prefix":"10.1016","volume":"13","author":[{"given":"J.F","family":"Weng","sequence":"first","affiliation":[]},{"given":"F.K","family":"Hwang","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0167-6377(93)90083-S_BIB1","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1016\/0166-218X(86)90026-0","article-title":"Search problem on graphs","volume":"14","author":"Aigner","year":"1986","journal-title":"Disc. Appl. Math."},{"key":"10.1016\/0167-6377(93)90083-S_BIB2","series-title":"Edge search in graphs and hypergraphs of bounded rank","author":"Alth\u00f6fer","year":"1991"},{"key":"10.1016\/0167-6377(93)90083-S_BIB3","doi-asserted-by":"crossref","unstructured":"T. Andreae, \u201cA search problem on graphs which generalizes some group testing problems with two defectives\u201d, Disc. Appl. Math. to appear.","DOI":"10.1016\/0012-365X(91)90003-K"},{"key":"10.1016\/0167-6377(93)90083-S_BIB4","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1137\/0601004","article-title":"A group testing problem","volume":"1","author":"Chang","year":"1980","journal-title":"SIAM J. Alg. Disc. Methods"},{"key":"10.1016\/0167-6377(93)90083-S_BIB5","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1137\/0602005","article-title":"A group testing problem on two disjoint sets","volume":"2","author":"Chang","year":"1981","journal-title":"SIAM J. Alg. Disc. Methods"},{"key":"10.1016\/0167-6377(93)90083-S_BIB6","series-title":"A binary search problem on graphs","author":"Franzkeit","year":"1991"}],"container-title":["Operations Research Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390083S?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:016763779390083S?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T09:51:09Z","timestamp":1552902669000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/016763779390083S"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,2]]},"references-count":6,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1993,2]]}},"alternative-id":["016763779390083S"],"URL":"https:\/\/doi.org\/10.1016\/0167-6377(93)90083-s","relation":{},"ISSN":["0167-6377"],"issn-type":[{"value":"0167-6377","type":"print"}],"subject":[],"published":{"date-parts":[[1993,2]]}}}