{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,15]],"date-time":"2026-07-15T03:28:08Z","timestamp":1784086088303,"version":"3.55.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1991,2,1]],"date-time":"1991-02-01T00:00:00Z","timestamp":665366400000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1991,2]]},"DOI":"10.1016\/0020-0190(91)90188-n","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:38:59Z","timestamp":1027640339000},"page":"197-200","source":"Crossref","is-referenced-by-count":54,"title":["On approximating the minimum independent dominating set"],"prefix":"10.1016","volume":"37","author":[{"given":"Robert W.","family":"Irving","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(91)90188-N_BIB1","first-page":"321","article-title":"Independent domination in trees","author":"Beyer","year":"1977","journal-title":"Proc. 8th Southeastern Conference on Combinatorics, Graph Theory and Computing"},{"key":"10.1016\/0020-0190(91)90188-N_BIB2","series-title":"Tech. Rept.","article-title":"Worst-case analysis of a new heuristic for the travelling salesman problem","author":"Christofides","year":"1976"},{"key":"10.1016\/0020-0190(91)90188-N_BIB3","doi-asserted-by":"crossref","first-page":"134","DOI":"10.1016\/0167-6377(82)90015-3","article-title":"Independent domination in chordal graphs","volume":"1","author":"Farber","year":"1982","journal-title":"Oper. Res. Lett."},{"key":"10.1016\/0020-0190(91)90188-N_BIB4","doi-asserted-by":"crossref","first-page":"43","DOI":"10.1145\/321921.321926","article-title":"The complexity of near-optimal graph coloring","volume":"23","author":"Garey","year":"1976","journal-title":"J. ACM"},{"key":"10.1016\/0020-0190(91)90188-N_BIB5","series-title":"Computers and Intractability","author":"Garey","year":"1979"},{"key":"10.1016\/0020-0190(91)90188-N_BIB6","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/0196-6774(84)90045-2","article-title":"The NP-completeness column: an ongoing guide","volume":"5","author":"Johnson","year":"1984","journal-title":"J. Algorithms"},{"key":"10.1016\/0020-0190(91)90188-N_BIB7","doi-asserted-by":"crossref","first-page":"555","DOI":"10.1145\/321958.321975","article-title":"P-complete approximation problems","volume":"23","author":"Sahni","year":"1976","journal-title":"J. ACM"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190188N?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:002001909190188N?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T04:23:44Z","timestamp":1555129424000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/002001909190188N"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1991,2]]},"references-count":7,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1991,2]]}},"alternative-id":["002001909190188N"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(91)90188-n","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1991,2]]}}}