{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,4]],"date-time":"2022-04-04T09:58:20Z","timestamp":1649066300423},"reference-count":10,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"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":[[1986,10]]},"DOI":"10.1007\/bf02592060","type":"journal-article","created":{"date-parts":[[2007,3,29]],"date-time":"2007-03-29T15:34:08Z","timestamp":1175182448000},"page":"245-255","source":"Crossref","is-referenced-by-count":3,"title":["On the greedy algorithm with random costs"],"prefix":"10.1007","volume":"36","author":[{"given":"Colin","family":"McDiarmid","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02592060_CR1","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1007\/BF01589437","volume":"35","author":"M.E. Dyer","year":"1986","unstructured":"M.E. Dyer, A.M. Frieze and C.J.H. McDiarmid, \u201cOn linear programs with random costs,\u201dMathematical Programming 35 (1986) 3\u201316.","journal-title":"Mathematical Programming"},{"key":"BF02592060_CR2","first-page":"17","volume":"5","author":"P. Erd\u00f6s","year":"1960","unstructured":"P. Erd\u00f6s and A. R\u00e9nyi, \u201cOn the evolution of random graphs,\u201dPublications of the Mathematical Institute of the Hungarian Academy of Science 5 (1960) 17\u201361.","journal-title":"Publications of the Mathematical Institute of the Hungarian Academy of Science"},{"key":"BF02592060_CR3","doi-asserted-by":"crossref","first-page":"47","DOI":"10.1016\/0166-218X(85)90058-7","volume":"10","author":"A.M. Frieze","year":"1985","unstructured":"A.M. Frieze, \u201cOn the value of a random minimum spanning tree problem,\u201dDiscrete Applied Mathematics 10 (1985) 47\u201356.","journal-title":"Discrete Applied Mathematics"},{"key":"BF02592060_CR4","volume-title":"An upper bound on the expected cost of an optimal assignment","author":"R.M. Karp","year":"1984","unstructured":"R.M. Karp, \u201cAn upper bound on the expected cost of an optimal assignment,\u201d Computer Science Division, University of California, Berkeley, 1984."},{"key":"BF02592060_CR5","volume-title":"Combinatorial Optimization: Annotated Bibliographies","author":"R.M. Karp","year":"1985","unstructured":"R.M. Karp, J.K. Lenstra, C.J.H. McDiarmid and A.H.G. Rinnooy Kan, \u201cProbabilistic analysis of combinatorial algorithms: An annotated bibliography,\u201d in: M. O\u2019hEigeartaigh, J.K. Lenstra and A.H.G. Rinnooy Kan, eds.,Combinatorial Optimization: Annotated Bibliographies (John Wiley and Sons Ltd., Chichester, 1985)."},{"issue":"2","key":"BF02592060_CR6","doi-asserted-by":"crossref","first-page":"463","DOI":"10.1093\/qmath\/33.4.463","volume":"33","author":"D.G. Kelly","year":"1982","unstructured":"D.G. Kelly and J.G. Oxley, \u201cThreshold functions for some properties of random subsets of projective spaces,\u201dOxford Quarterly Journal of Mathematics (2) 33 (1982) 463\u2013469.","journal-title":"Oxford Quarterly Journal of Mathematics"},{"key":"BF02592060_CR7","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1287\/moor.7.2.159","volume":"7","author":"L.R. Matthews","year":"1982","unstructured":"L.R. Matthews, \u201cClosure in independence systems,\u201dMathematics of Operations Research 7 (1982) 159\u2013171.","journal-title":"Mathematics of Operations Research"},{"key":"BF02592060_CR8","doi-asserted-by":"crossref","first-page":"149","DOI":"10.2307\/1426987","volume":"15","author":"C.J.H. McDiarmid","year":"1983","unstructured":"C.J.H. McDiarmid, \u201cGeneral first-passage percolation,\u201dAdvances in Applied Probability 15 (1983) 149\u2013161.","journal-title":"Advances in Applied Probability"},{"key":"BF02592060_CR9","series-title":"Lecture Notes in Mathematics","doi-asserted-by":"crossref","first-page":"358","DOI":"10.1007\/BFb0092281","volume-title":"On molecular and atomic matroids","author":"H. Narayan","year":"1981","unstructured":"H. Narayan and M.N. Vartak, \u201cOn molecular and atomic matroids,\u201dLecture Notes in Mathematics 885 (Springer-Verlag, Berlin-Heidelberg-New York, 1981), pp. 358\u2013364."},{"key":"BF02592060_CR10","volume-title":"Matroid Theory","author":"D.J.A. Welsh","year":"1976","unstructured":"D.J.A. Welsh,Matroid Theory (Academic Press, London-New York-San Francisco, 1976)."}],"container-title":["Mathematical Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592060.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02592060\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02592060","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T23:37:52Z","timestamp":1558395472000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02592060"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":10,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["BF02592060"],"URL":"https:\/\/doi.org\/10.1007\/bf02592060","relation":{},"ISSN":["0025-5610","1436-4646"],"issn-type":[{"value":"0025-5610","type":"print"},{"value":"1436-4646","type":"electronic"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}