{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T15:46:44Z","timestamp":1770738404191,"version":"3.49.0"},"reference-count":7,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1997,1,1]],"date-time":"1997-01-01T00:00:00Z","timestamp":852076800000},"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":[[1997,1]]},"DOI":"10.1016\/s0020-0190(96)00191-3","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:32:24Z","timestamp":1049736744000},"page":"11-14","source":"Crossref","is-referenced-by-count":11,"title":["On-line algorithms for the dominating set problem"],"prefix":"10.1016","volume":"61","author":[{"given":"Gow-Hsing","family":"King","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Guey","family":"Tzeng","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0020-0190(96)00191-3_BIB1","doi-asserted-by":"crossref","first-page":"177","DOI":"10.1016\/0166-218X(88)90064-9","article-title":"Finding a minimum independent dominating set in a permutation graph","volume":"21","author":"Atallah","year":"1988","journal-title":"Discrete Appl. Math."},{"key":"10.1016\/S0020-0190(96)00191-3_BIB2","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1016\/0020-0190(92)90209-E","article-title":"The greedy algorithm is optimal for on-line edge coloring","volume":"44","author":"Bar-Noy","year":"1992","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0020-0190(96)00191-3_BIB3","series-title":"Computers and Intractability: A Guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0020-0190(96)00191-3_BIB4","series-title":"Algorithmic Graph Theory and Perfect Graphs","author":"Golumbic","year":"1980"},{"key":"10.1016\/S0020-0190(96)00191-3_BIB5","series-title":"Proc. 22nd ACM Symp. on Theory of Computing","first-page":"352","article-title":"An optimal algorithm for on-line bipartite matching","author":"Karp","year":"1990"},{"key":"10.1016\/S0020-0190(96)00191-3_BIB6","doi-asserted-by":"crossref","first-page":"208","DOI":"10.1016\/0196-6774(90)90003-W","article-title":"Competitive algorithms for server problems","volume":"11","author":"Manasse","year":"1990","journal-title":"J. Algorithms"},{"key":"10.1016\/S0020-0190(96)00191-3_BIB7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0304-3975(91)90265-4","article-title":"Efficient algorithms for the minimum weighted dominating clique problem on permutation graphs","volume":"91","author":"Srinivasan","year":"1991","journal-title":"Theoret. Comput. Sci."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001913?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0020019096001913?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,30]],"date-time":"2019-04-30T16:53:49Z","timestamp":1556643229000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0020019096001913"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,1]]},"references-count":7,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1997,1]]}},"alternative-id":["S0020019096001913"],"URL":"https:\/\/doi.org\/10.1016\/s0020-0190(96)00191-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1997,1]]}}}