{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,7]],"date-time":"2026-07-07T11:00:59Z","timestamp":1783422059442,"version":"3.54.6"},"reference-count":5,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1996,10,1]],"date-time":"1996-10-01T00:00:00Z","timestamp":844128000000},"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":6133,"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":[[1996,10]]},"DOI":"10.1016\/0166-218x(95)00106-2","type":"journal-article","created":{"date-parts":[[2003,5,12]],"date-time":"2003-05-12T23:10:20Z","timestamp":1052781020000},"page":"217-229","source":"Crossref","is-referenced-by-count":646,"title":["Landmarks in graphs"],"prefix":"10.1016","volume":"70","author":[{"given":"Samir","family":"Khuller","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Balaji","family":"Raghavachari","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Azriel","family":"Rosenfeld","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(95)00106-2_BIB1","series-title":"Computers and Intractability: a guide to the Theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(95)00106-2_BIB2","first-page":"191","article-title":"The metric dimension of a graph","author":"Harary","year":"1976","journal-title":"Ars Combin."},{"key":"10.1016\/0166-218X(95)00106-2_BIB3","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"J. Comput. Systems Sci."},{"key":"10.1016\/0166-218X(95)00106-2_BIB4","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1016\/0012-365X(75)90058-8","article-title":"On the ratio of optimal integral and fractional covers","volume":"13","author":"Lov\u00e1sz","year":"1975","journal-title":"Discrete Math."},{"key":"10.1016\/0166-218X(95)00106-2_BIB5","doi-asserted-by":"crossref","first-page":"113","DOI":"10.1016\/0734-189X(84)90051-3","article-title":"Metric bases in digital geometry","volume":"25","author":"Melter","year":"1984","journal-title":"Comput. Vision Graphics. Image Process"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95001062?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X95001062?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T01:30:02Z","timestamp":1555983002000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X95001062"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,10]]},"references-count":5,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1996,10]]}},"alternative-id":["0166218X95001062"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(95)00106-2","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1996,10]]}}}