{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,12,14]],"date-time":"2024-12-14T05:17:30Z","timestamp":1734153450652,"version":"3.30.2"},"reference-count":4,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1986,1,1]],"date-time":"1986-01-01T00:00:00Z","timestamp":504921600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2004,3,5]],"date-time":"2004-03-05T00:00:00Z","timestamp":1078444800000},"content-version":"vor","delay-in-days":6638,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Information Processing Letters"],"published-print":{"date-parts":[[1986,1]]},"DOI":"10.1016\/0020-0190(86)90037-2","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T19:37:33Z","timestamp":1047670653000},"page":"21-24","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":55,"title":["Linear programming in O(n \u00d7 3d) time"],"prefix":"10.1016","volume":"22","author":[{"given":"Kenneth L.","family":"Clarkson","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0020-0190(86)90037-2_BIB1","unstructured":"M.E. Dyer, On a multidimensional search technique and its application to the Euclidean one-centre problem, Unpublished manuscript."},{"key":"10.1016\/0020-0190(86)90037-2_BIB2","series-title":"Proc. ACM STOC","article-title":"A new polynomial-time algorithm for linear programming","author":"Karmarkar","year":"1984"},{"key":"10.1016\/0020-0190(86)90037-2_BIB3","first-page":"1093","article-title":"A polynomial algorithm for linear programming","volume":"244","author":"Khachian","year":"1979","journal-title":"Dokl. Acad. Nauk SSSR"},{"key":"10.1016\/0020-0190(86)90037-2_BIB4","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","article-title":"Linear programming in linear time when the dimension is fixed","volume":"31","author":"Megiddo","year":"1984","journal-title":"J. Assoc. Comput. Mach."}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900372?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019086900372?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2024,12,13]],"date-time":"2024-12-13T09:06:52Z","timestamp":1734080812000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019086900372"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,1]]},"references-count":4,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1986,1]]}},"alternative-id":["0020019086900372"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(86)90037-2","relation":{},"ISSN":["0020-0190"],"issn-type":[{"type":"print","value":"0020-0190"}],"subject":[],"published":{"date-parts":[[1986,1]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Linear programming in O(n \u00d7 3d2) time","name":"articletitle","label":"Article Title"},{"value":"Information Processing Letters","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0020-0190(86)90037-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1986 Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}