{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T15:21:19Z","timestamp":1725549679110},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540281016"},{"type":"electronic","value":"9783540317111"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11534273_4","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:31:47Z","timestamp":1268400707000},"page":"24-35","source":"Crossref","is-referenced-by-count":2,"title":["The Multi-radius Cover Problem"],"prefix":"10.1007","author":[{"given":"Refael","family":"Hassin","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Danny","family":"Segev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1016\/0196-6774(81)90020-1","volume":"2","author":"R. Bar-Yehuda","year":"1981","unstructured":"Bar-Yehuda, R., Even, S.: A linear-time approximation algorithm for the weighted vertex cover problem. Journal of Algorithms\u00a02, 198\u2013203 (1981)","journal-title":"Journal of Algorithms"},{"key":"4_CR2","first-page":"27","volume":"25","author":"R. Bar-Yehuda","year":"1985","unstructured":"Bar-Yehuda, R., Even, S.: A local-ratio theorem for approximating the weighted vertex cover problem. Annals of Discrete Mathematics\u00a025, 27\u201346 (1985)","journal-title":"Annals of Discrete Mathematics"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Chuzhoy, J., Naor, J.: Covering problems with hard capacities. In: Proceedings of the 43rd Annual Symposium on Foundations of Computer Science, pp. 481\u2013489 (2002)","DOI":"10.1109\/SFCS.2002.1181972"},{"key":"4_CR4","doi-asserted-by":"crossref","unstructured":"Dinur, I., Safra, S.: The importance of being biased. In: Proceedings of the 34th Annual ACM Symposium on Theory of Computing, pp. 33\u201342 (2002)","DOI":"10.1145\/509907.509915"},{"key":"4_CR5","doi-asserted-by":"publisher","first-page":"257","DOI":"10.1016\/S0196-6774(03)00053-1","volume":"48","author":"S. Guha","year":"2003","unstructured":"Guha, S., Hassin, R., Khuller, S., Or, E.: Capacitated vertex covering. Journal of Algorithms\u00a048, 257\u2013270 (2003)","journal-title":"Journal of Algorithms"},{"key":"4_CR6","doi-asserted-by":"publisher","first-page":"1608","DOI":"10.1137\/S0097539700381097","volume":"31","author":"E. Halperin","year":"2002","unstructured":"Halperin, E.: Improved approximation algorithms for the vertex cover problem in graphs and hypergraphs. SIAM Journal on Computing\u00a031, 1608\u20131623 (2002)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR7","doi-asserted-by":"crossref","unstructured":"Hassin, R., Levin, A.: The minimum generalized vertex cover problem. In: Proceedings of the 11th Annual European Symposium on Algorithms, pp. 289\u2013300 (2003)","DOI":"10.1007\/978-3-540-39658-1_28"},{"key":"4_CR8","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1137\/0211045","volume":"11","author":"D.S. Hochbaum","year":"1982","unstructured":"Hochbaum, D.S.: Approximation algorithms for the set covering and vertex cover problems. SIAM Journal on Computing\u00a011, 555\u2013556 (1982)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR9","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/s101070100262","volume":"91","author":"D.P. Williamson","year":"2002","unstructured":"Williamson, D.P.: The primal-dual method for approximation algorithms. Mathematical Programming, Series B\u00a091, 447\u2013478 (2002)","journal-title":"Mathematical Programming, Series B"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11534273_4.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:10:03Z","timestamp":1605643803000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11534273_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540281016","9783540317111"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/11534273_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}