{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:47:55Z","timestamp":1725662875963},"publisher-location":"Berlin, Heidelberg","reference-count":8,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108542"},{"type":"electronic","value":"9783540387657"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1981]]},"DOI":"10.1007\/3-540-10854-8_3","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T17:30:35Z","timestamp":1330191035000},"page":"24-33","source":"Crossref","is-referenced-by-count":2,"title":["Probabilistic analysis of the performance of greedy strategies over different classes of combinatorial problems"],"prefix":"10.1007","author":[{"given":"G.","family":"Ausiello","sequence":"first","affiliation":[]},{"given":"M.","family":"Protasi","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,7,28]]},"reference":[{"key":"3_CR1","doi-asserted-by":"crossref","unstructured":"B.BOLLOBAS, P.ERD\u0150S: Cliques in random graphs, Math. Proc. Cambridge Phil. Soc. Vol. 80 (1976).","DOI":"10.1017\/S0305004100053056"},{"key":"3_CR2","unstructured":"G.D'ATRI: Probabilistic analysis of the knapsack problem, Techn. Rep. n.7, g.d.r.n. 22 CNRS (1978)."},{"key":"3_CR3","volume-title":"Probabilistic methods in combinatories","author":"P. Erd\u0151s","year":"1974","unstructured":"P. ERD\u0150S, J. SPENCER: Probabilistic methods in combinatories, Academic Press, N.Y. (1974)."},{"key":"3_CR4","volume-title":"Computers and intractability: a guide to the theory of NP-completeness","author":"M.R. Garey","year":"1979","unstructured":"M.R. GAREY, D.S. JOHNSON: Computers and intractability: a guide to the theory of NP-completeness, Freeman, San Francisco (1979)."},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"G.R.GRIMMETT, C.J.H.Mc DIARMID: On colouring random graphs, Math. Proc. Cambridge Phil. Soc. Vol. 77 (1975).","DOI":"10.1017\/S0305004100051124"},{"key":"3_CR6","volume-title":"Algorithms and Complexity: New directions and recent results","author":"R.M. Karp","year":"1976","unstructured":"R.M. KARP: The probabilistic analysis of some combinatorial searc algorithms; in J.F. Traub (ed.) \u201cAlgorithms and Complexity: New directions and recent results\u201d, Academic Press, N.Y. (1976)"},{"key":"3_CR7","unstructured":"D.W.MATULA: The largest clique size in a random graph, Techn. Rep. CS76-03, Southern Metho. Univ. (1976)."},{"key":"3_CR8","unstructured":"R. TERADA: Polynomial time algorithms for NP-hard problems which are optimal or near optimal with probability one, Techn. Rep. 79\u2013351, Dep. Comp. Sc., Wisconsin Univ. (1979)."}],"container-title":["Lecture Notes in Computer Science","Fundamentals of Computation Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-10854-8_3.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T20:39:47Z","timestamp":1619555987000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-10854-8_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1981]]},"ISBN":["9783540108542","9783540387657"],"references-count":8,"URL":"https:\/\/doi.org\/10.1007\/3-540-10854-8_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1981]]}}}