{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,9]],"date-time":"2024-09-09T14:36:43Z","timestamp":1725892603186},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642212031"},{"type":"electronic","value":"9783642212048"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-21204-8_22","type":"book-chapter","created":{"date-parts":[[2011,5,28]],"date-time":"2011-05-28T01:15:25Z","timestamp":1306545325000},"page":"185-195","source":"Crossref","is-referenced-by-count":0,"title":["Tight Approximation Bounds for Greedy Frugal Coverage Algorithms"],"prefix":"10.1007","author":[{"given":"Ioannis","family":"Caragiannis","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Christos","family":"Kaklamanis","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Maria","family":"Kyropoulou","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"22_CR1","doi-asserted-by":"publisher","first-page":"555","DOI":"10.1007\/s00224-008-9112-3","volume":"45","author":"S. Athanassopoulos","year":"2009","unstructured":"Athanassopoulos, S., Caragiannis, I., Kaklamanis, C.: Analysis of approximation algorithms for k-set cover using factor-revealing linear programs. Theory of Computing Systems\u00a045(3), 555\u2013576 (2009)","journal-title":"Theory of Computing Systems"},{"key":"22_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1007\/978-3-642-03816-7_9","volume-title":"Mathematical Foundations of Computer Science 2009","author":"S. Athanassopoulos","year":"2009","unstructured":"Athanassopoulos, S., Caragiannis, I., Kaklamanis, C., Kyropoulou, M.: An improved approximation bound for spanning star forest and color saving. In: Kr\u00e1lovi\u010d, R., Niwi\u0144ski, D. (eds.) MFCS 2009. LNCS, vol.\u00a05734, pp. 90\u2013101. Springer, Heidelberg (2009)"},{"issue":"2","key":"22_CR3","doi-asserted-by":"publisher","first-page":"959","DOI":"10.1137\/06067660X","volume":"23","author":"I. Caragiannis","year":"2009","unstructured":"Caragiannis, I.: Wavelength management in WDM rings to maximize the number of connections. SIAM Journal on Discrete Mathematics\u00a023(2), 959\u2013978 (2009)","journal-title":"SIAM Journal on Discrete Mathematics"},{"doi-asserted-by":"crossref","unstructured":"Duh, R., F\u00fcrer, M.: Approximation of k-set cover by semi local optimization. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 256\u2013264 (1997)","key":"22_CR4","DOI":"10.1145\/258533.258599"},{"issue":"4","key":"22_CR5","doi-asserted-by":"publisher","first-page":"634","DOI":"10.1145\/285055.285059","volume":"45","author":"U. Feige","year":"1998","unstructured":"Feige, U.: A threshold of ln n for approximating set cover. Journal of the ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of the ACM"},{"unstructured":"Feige, U., Jozeph, S.: Oblivious algorithms for the maximum directed cut problem. arXiv: 1010.0406 (2010)","key":"22_CR6"},{"unstructured":"Huang, C.-C., Svitkina, Z.: Donation center location problem. In: Proceedings of the 29th IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS), pp. 227\u2013238 (2009)","key":"22_CR7"},{"issue":"6","key":"22_CR8","doi-asserted-by":"publisher","first-page":"795","DOI":"10.1145\/950620.950621","volume":"50","author":"K. Jain","year":"2003","unstructured":"Jain, K., Mahdian, M., Markakis, E., Saberi, A., Vazirani, V.V.: Greedy facility location algorithms analyzed using dual fitting with factor-revealing LP. Journal of the ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"Journal of the ACM"},{"key":"22_CR9","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","volume":"9","author":"D.S. Johnson","year":"1974","unstructured":"Johnson, D.S.: Approximation algorithms for combinatorial problems. Journal of Computer and System Sciences\u00a09, 256\u2013278 (1974)","journal-title":"Journal of Computer and System Sciences"},{"issue":"1","key":"22_CR10","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1137\/060655225","volume":"23","author":"A. Levin","year":"2008","unstructured":"Levin, A.: Approximating the unweighted k-set cover problem: greedy meets local search. SIAM Journal on Discrete Mathematics\u00a023(1), 251\u2013264 (2008)","journal-title":"SIAM Journal on Discrete Mathematics"},{"issue":"12-14","key":"22_CR11","doi-asserted-by":"publisher","first-page":"1033","DOI":"10.1016\/j.tcs.2010.12.004","volume":"412","author":"A. Levin","year":"2011","unstructured":"Levin, A., Yovel, U.: Uniform unweighted set cover: the power of non-oblivious local search. Theoretical Computer Science\u00a0412(12-14), 1033\u20131053 (2011)","journal-title":"Theoretical Computer Science"},{"doi-asserted-by":"crossref","unstructured":"Raz, R., Safra, S.: A sub-constant error-probability low-degree test, and sub-constant error-probability PCP characterization of NP. In: Proceedings of the 29th Annual ACM Symposium on Theory of Computing (STOC), pp. 475\u2013484 (1997)","key":"22_CR12","DOI":"10.1145\/258533.258641"}],"container-title":["Lecture Notes in Computer Science","Frontiers in Algorithmics and Algorithmic Aspects in Information and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21204-8_22","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,27]],"date-time":"2019-03-27T22:24:04Z","timestamp":1553725444000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21204-8_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642212031","9783642212048"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21204-8_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}