{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,6]],"date-time":"2022-04-06T02:37:58Z","timestamp":1649212678536},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"1-4","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf01553905","type":"journal-article","created":{"date-parts":[[2005,4,20]],"date-time":"2005-04-20T18:07:35Z","timestamp":1114020455000},"page":"511-517","source":"Crossref","is-referenced-by-count":0,"title":["Extending NC and RNC algorithms"],"prefix":"10.1007","volume":"4","author":[{"given":"Nimrod","family":"Megiddo","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"BF01553905_CR1","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"N. Megiddo, Combinatorial optimization with rational objective functions,Math. Oper. Res. 4 (1979) 414\u2013424.","journal-title":"Math. Oper. Res."},{"issue":"4","key":"BF01553905_CR2","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, Applying parallel computation algorithms in the design of serial algorithms,J. Assoc. Comput. Mach. 30, 4 (1983) 337\u2013341.","journal-title":"J. Assoc. Comput. Mach."},{"issue":"2","key":"BF01553905_CR3","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1137\/0604021","volume":"4","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo and A. Tamir, Finding least-distances lines,SIAMJ. Algebraic Discrete Methods 4, 2 (1983) 207\u2013211.","journal-title":"SIAMJ. Algebraic Discrete Methods"},{"issue":"4","key":"BF01553905_CR4","doi-asserted-by":"crossref","first-page":"751","DOI":"10.1137\/0212051","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo and A. Tamir, New results on the complexity of p-center problems,SIAM J. Comput. 12, 4 (1983) 751\u2013758.","journal-title":"SIAM J. Comput."},{"key":"BF01553905_CR5","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1016\/0196-6774(86)90027-1","volume":"1","author":"N. Megiddo","year":"1986","unstructured":"N. Megiddo and E. Zemel, A randomizingO(n logn) algorithm for the weighted 1-center problem,J. Algorithms 1 (1986) 358\u2013368.","journal-title":"J. Algorithms"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553905.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01553905\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01553905","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T10:21:13Z","timestamp":1556878873000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01553905"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":5,"journal-issue":{"issue":"1-4","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01553905"],"URL":"https:\/\/doi.org\/10.1007\/bf01553905","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}