{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:58:07Z","timestamp":1725487087032},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540335207"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/3-540-33521-8_42","type":"book-chapter","created":{"date-parts":[[2007,7,3]],"date-time":"2007-07-03T03:10:01Z","timestamp":1183432201000},"page":"391-395","source":"Crossref","is-referenced-by-count":0,"title":["On Greedy Algorithms with Weights for Construction of Partial Covers"],"prefix":"10.1007","author":[{"given":"Mikhail Ju.","family":"Moshkov","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marcin","family":"Piliszczuk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Beata","family":"Zielosko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"42_CR1","unstructured":"1. Cheriyan, J., Ravi, R. (1998) Lecture notes on approximation algorithms for network problems. http:\/\/www.math.uwaterloo.ca\/~jcheriya\/lecnotes.html"},{"issue":"3","key":"42_CR2","doi-asserted-by":"publisher","first-page":"233","DOI":"10.1287\/moor.4.3.233","volume":"4","author":"V. Chv\u00e1tal","year":"1979","unstructured":"2. Chv\u00e1tal, V. (1979) A greedy heuristic for the set-covering problem. Mathematics of Operations Research 4(3), 233\u2013235","journal-title":"Mathematics of Operations Research"},{"key":"42_CR3","volume-title":"The Computational Complexity of Machine Learning","author":"M.J. Kearns","year":"1990","unstructured":"3. Kearns, M.J. (1990) The Computational Complexity of Machine Learning. MIT Press, Cambridge, Massachussetts"},{"key":"42_CR4","doi-asserted-by":"crossref","unstructured":"4. Moshkov, M.Ju. (2003) Greedy algorithm for set cover in context of knowledge discovery problems. Proceedings of the International Workshop on Rough Sets in Knowledge Discovery and Soft Computing (ETAPS 2003 Satellite Event). Warsaw, Poland. Electronic Notes in Theoretical Computer Science 82(4)","DOI":"10.1016\/S1571-0661(04)80716-3"},{"key":"42_CR5","unstructured":"5. Moshkov, M.Ju. (2003) On greedy algorithm for partial cover construction. Proceedings of the 14-th International Workshop Design and Complexity of Control Systems. Nizhny Novgorod, Russia 57 (in Russian)"},{"key":"42_CR6","unstructured":"6. Moshkov, M.Ju., Piliszczuk, M., Zielosko, B. (2005) On greedy algorithm for construction of partial covers. Proceedings of the 14-th International Conference Problems of Theoretical Cybernetics. Penza, Russia 103 (in Russian)"},{"key":"42_CR7","volume-title":"Rough Sets - Theoretical Aspects of Reasoning about Data","author":"Z. Pawlak","year":"1991","unstructured":"7. Pawlak, Z. (1991) Rough Sets - Theoretical Aspects of Reasoning about Data. Kluwer Academic Publishers, Dordrecht Boston London"},{"key":"42_CR8","unstructured":"8. Skowron, A. (2000) Rough sets in KDD. Proceedings of the 16-th World Computer Congress (IFIP\u20322000). Beijing, China 1\u201314"},{"key":"42_CR9","unstructured":"9. Slav\u00edk, P. (1998) Approximation algorithms for set cover and related problems. Ph.D. thesis. University of New York at Bu.alo"}],"container-title":["Advances in Soft Computing","Intelligent Information Processing and Web Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-33521-8_42.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:56:09Z","timestamp":1605646569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-33521-8_42"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540335207"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-33521-8_42","relation":{},"subject":[]}}