{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T01:54:07Z","timestamp":1760061247798,"version":"build-2065373602"},"reference-count":4,"publisher":"Elsevier BV","issue":"5","license":[{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2001,5,1]],"date-time":"2001-05-01T00:00:00Z","timestamp":988675200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2001,5]]},"DOI":"10.1006\/jpdc.2000.1706","type":"journal-article","created":{"date-parts":[[2002,9,18]],"date-time":"2002-09-18T14:06:38Z","timestamp":1032357998000},"page":"662-666","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":1,"title":["A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters"],"prefix":"10.1006","volume":"61","author":[{"given":"Muhammad H.","family":"Alsuwaiyel","sequence":"first","affiliation":[]}],"member":"78","reference":[{"year":"1993","series-title":"Parallel Computational Geometry","author":"Akl","key":"10.1006\/jpdc.2000.1706_RF1"},{"key":"10.1006\/jpdc.2000.1706_RF2","series-title":"Proc. of the Fourth Annual Symposium on Computational Geometry","article-title":"Clustering algorithms based on minimum and maximum spanning trees","author":"Asano","year":"1988"},{"key":"10.1006\/jpdc.2000.1706_RF3","doi-asserted-by":"crossref","first-page":"265","DOI":"10.1007\/BF02187699","article-title":"Diameter partitioning","volume":"1","author":"Avis","year":"1986","journal-title":"Discrete Comput. Geom."},{"key":"10.1006\/jpdc.2000.1706_RF4","series-title":"Proceedings of the Sixth International Conference on the Theory and Applications of Graphs","article-title":"Partitioning points and graphs to minimize the maximum or the sum of diameters","author":"Monma","year":"1989"}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731500917064?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731500917064?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,9]],"date-time":"2025-10-09T21:47:29Z","timestamp":1760046449000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731500917064"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,5]]},"references-count":4,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2001,5]]}},"alternative-id":["S0743731500917064"],"URL":"https:\/\/doi.org\/10.1006\/jpdc.2000.1706","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[2001,5]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"A Parallel Algorithm for Partitioning a Point Set to Minimize the Maximum of Diameters","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1006\/jpdc.2000.1706","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2001 Academic Press. All rights reserved.","name":"copyright","label":"Copyright"}]}}