{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T13:16:18Z","timestamp":1725455778928},"publisher-location":"Berlin\/Heidelberg","reference-count":4,"publisher":"Springer-Verlag","isbn-type":[{"type":"print","value":"3540552847"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0023824","type":"book-chapter","created":{"date-parts":[[2005,11,19]],"date-time":"2005-11-19T06:17:40Z","timestamp":1132381060000},"page":"130-138","source":"Crossref","is-referenced-by-count":2,"title":["Average case analysis of a greedy algorithm for the minimum hitting set problem"],"prefix":"10.1007","author":[{"given":"W.","family":"Fernandez de la Vega","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"V. Th.","family":"Paschos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"R.","family":"Saad","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"13_CR1","doi-asserted-by":"crossref","first-page":"49","DOI":"10.2307\/3212147","volume":"7","author":"T. G. Kurtz","year":"1970","unstructured":"T. G. Kurtz, Solutions of Ordinary Differential Equations as Limits of Pure Jump Markov Processes, J. Appl. Prob. 7, pp. 49\u201358, 1970.","journal-title":"J. Appl. Prob."},{"key":"13_CR2","volume-title":"Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson, Computers and Intractability \u2014 A Guide to the Theory of NP-Completeness, (Freeman, New York, 1979)."},{"key":"13_CR3","unstructured":"J. F. Gimpel, A Stochastic Approach to the Solution of Large Covering Problems, IEEE Switching and Automata Theory, pp. 76\u201383, 1967."},{"key":"13_CR4","first-page":"1","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 Search Algorithms, in J. F. Traub (ed.), Algorithms and Complexity: New Directions and Recent Results, Academic Press, New York, pp. 1\u201319, 1976."}],"container-title":["Lecture Notes in Computer Science","LATIN '92"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0023824.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T21:50:44Z","timestamp":1607550644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0023824"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["3540552847"],"references-count":4,"URL":"https:\/\/doi.org\/10.1007\/bfb0023824","relation":{},"subject":[]}}