{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T06:29:43Z","timestamp":1648794583341},"reference-count":4,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1980,12,1]],"date-time":"1980-12-01T00:00:00Z","timestamp":344476800000},"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":11916,"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":[[1980,12]]},"DOI":"10.1016\/0166-218x(80)90034-7","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T23:46:59Z","timestamp":1027640819000},"page":"361-363","source":"Crossref","is-referenced-by-count":2,"title":["NP-completeness of some type of p-center problem"],"prefix":"10.1016","volume":"2","author":[{"given":"Tohru","family":"Kikuno","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Noriyoshi","family":"Yoshida","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yoshiaki","family":"Kakuda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0166-218X(80)90034-7_BIB1","series-title":"The complexity of p-center problems on networks","author":"Ibaraki","year":"1979"},{"key":"10.1016\/0166-218X(80)90034-7_BIB2","series-title":"Computers and Intractability: A Guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/0166-218X(80)90034-7_BIB3","doi-asserted-by":"crossref","first-page":"513","DOI":"10.1137\/0137040","article-title":"An algorithmic approach to network location problems I: The p-centers","volume":"37","author":"Kariv","year":"1979","journal-title":"SIAM J. Appl. Math."},{"key":"10.1016\/0166-218X(80)90034-7_BIB4","series-title":"Paper of Technical Group, TGCAS 79-154","article-title":"On the minimization of the number of through-nodes in computer-communication nets","author":"Kikuno","year":"1980"}],"container-title":["Discrete Applied Mathematics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X80900347?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0166218X80900347?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,13]],"date-time":"2019-04-13T00:28:38Z","timestamp":1555115318000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0166218X80900347"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1980,12]]},"references-count":4,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1980,12]]}},"alternative-id":["0166218X80900347"],"URL":"https:\/\/doi.org\/10.1016\/0166-218x(80)90034-7","relation":{},"ISSN":["0166-218X"],"issn-type":[{"value":"0166-218X","type":"print"}],"subject":[],"published":{"date-parts":[[1980,12]]}}}