{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,7]],"date-time":"2025-10-07T14:31:18Z","timestamp":1759847478287},"reference-count":9,"publisher":"Springer Science and Business Media LLC","issue":"1-3","license":[{"start":{"date-parts":[[1989,5,1]],"date-time":"1989-05-01T00:00:00Z","timestamp":609984000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mathematical Programming"],"published-print":{"date-parts":[[1989,5]]},"DOI":"10.1007\/bf01587088","type":"journal-article","created":{"date-parts":[[2005,4,28]],"date-time":"2005-04-28T05:09:28Z","timestamp":1114664968000},"page":"203-212","source":"Crossref","is-referenced-by-count":31,"title":["A randomized algorithm for fixed-dimensional linear programming"],"prefix":"10.1007","volume":"44","author":[{"given":"M. E.","family":"Dyer","sequence":"first","affiliation":[]},{"given":"A. M.","family":"Frieze","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"21","DOI":"10.1016\/0020-0190(86)90037-2","volume":"22","author":"K.L. Clarkson","year":"1986","unstructured":"K.L. Clarkson, \u201cLinear programming in $$O(n \\times 3^{d^2 } )$$ time,\u201dInformation Processing Letters 22 (1986) 21\u201324.","journal-title":"Information Processing Letters"},{"key":"CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF02187879","volume":"2","author":"K.L. Clarkson","year":"1987","unstructured":"K.L. Clarkson, \u201cNew applications of random sampling to computational geometry,\u201dJournal of Discrete and Computational Geometry 2 (1987), 195\u2013222.","journal-title":"Journal of Discrete and Computational Geometry"},{"key":"CR3","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"M.E. Dyer","year":"1984","unstructured":"M.E. Dyer, \u201cLinear time algorithms for two- and three-variable linear programs,\u201dSIAM Journal on Computing 13 (1984) 31\u201345.","journal-title":"SIAM Journal on Computing"},{"key":"CR4","doi-asserted-by":"crossref","first-page":"725","DOI":"10.1137\/0215052","volume":"15","author":"M.E. Dyer","year":"1986","unstructured":"M.E. Dyer, \u201cOn a multidimensional search problem and its application to the Euclidean one-centre problem,\u201dSIAM Journal on Computing 15 (1986) 725\u2013738.","journal-title":"SIAM Journal on Computing"},{"key":"CR5","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"D. Haussler and E. Welzl, \u201c\u03b5-nets and simplex range queries,\u201dDiscrete and Computational Geometry 2 (1987) 127\u2013151.","journal-title":"Discrete and Computational Geometry"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W. Hoeffding","year":"1963","unstructured":"W. Hoeffding, \u201cProbability inequalities for sums of bounded random variables,\u201dJournal of the American Statistical Association 58 (1963) 13\u201330.","journal-title":"Journal of the American Statistical Association"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"759","DOI":"10.1137\/0212052","volume":"12","author":"N. Megiddo","year":"1983","unstructured":"N. Megiddo, \u201cLinear-time algorithms for linear programming \u211d3 and related problems,\u201dSIAM Journal on Computing 12 (1983) 759\u2013776.","journal-title":"SIAM Journal on Computing"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"N. Megiddo, \u201cLinear programming in linear time when the dimension is fixed,\u201dJournal of the Association for Computing Machinery 31 (1984) 114\u2013127.","journal-title":"Journal of the Association for Computing Machinery"},{"key":"CR9","volume-title":"Theory of Linear and Integer Programming","author":"A. Schrijver","year":"1986","unstructured":"A. Schrijver,Theory of Linear and Integer Programming (Wiley, Chichester, 1986)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587088.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01587088\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01587088","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,3]],"date-time":"2019-05-03T11:31:37Z","timestamp":1556883097000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01587088"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,5]]},"references-count":9,"journal-issue":{"issue":"1-3","published-print":{"date-parts":[[1989,5]]}},"alternative-id":["BF01587088"],"URL":"https:\/\/doi.org\/10.1007\/bf01587088","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,5]]}}}