{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:19:04Z","timestamp":1759637944577},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642255908"},{"type":"electronic","value":"9783642255915"}],"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-25591-5_50","type":"book-chapter","created":{"date-parts":[[2011,12,3]],"date-time":"2011-12-03T00:32:34Z","timestamp":1322872354000},"page":"484-493","source":"Crossref","is-referenced-by-count":2,"title":["Packing-Based Approximation Algorithm for the k-Set Cover Problem"],"prefix":"10.1007","author":[{"given":"Martin","family":"F\u00fcrer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Huiwen","family":"Yu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"3","key":"50_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":"50_CR2","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, pp. 256\u2013264 (1997)","DOI":"10.1145\/258533.258599"},{"issue":"4","key":"50_CR3","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 ACM\u00a045(4), 634\u2013652 (1998)","journal-title":"Journal of ACM"},{"key":"50_CR4","unstructured":"F\u00fcrer, M., Yu, H.: Packing-based approximating algorithm for the k-set cover problem, http:\/\/arxiv.org\/abs\/1109.3418"},{"key":"50_CR5","doi-asserted-by":"publisher","first-page":"305","DOI":"10.1016\/0020-0190(93)90173-7","volume":"48","author":"O. Goldschmidt","year":"1993","unstructured":"Goldschmidt, O., Hochbaum, D.S., Yu, G.: A modified greedy heuristic for the set covering problem with improved worst case bound. Information Processing Letters\u00a048, 305\u2013310 (1993)","journal-title":"Information Processing Letters"},{"key":"50_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"118","DOI":"10.1007\/3-540-61310-2_10","volume-title":"Integer Programming and Combinatorial Optimization","author":"M.M. Halld\u00f3rsson","year":"1996","unstructured":"Halld\u00f3rsson, M.M.: Approximating k-Set Cover and Complementary Graph Coloring. In: Cunningham, W.H., Queyranne, M., McCormick, S.T. (eds.) IPCO 1996. LNCS, vol.\u00a01084, pp. 118\u2013131. Springer, Heidelberg (1996)"},{"key":"50_CR7","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/s00037-006-0205-6","volume":"15","author":"E. Hazan","year":"2006","unstructured":"Hazan, E., Safra, S., Schwartz, O.: On the complexity of approximating k-set packing. Computational Complexity\u00a015, 20\u201339 (2006)","journal-title":"Computational Complexity"},{"issue":"1","key":"50_CR8","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C.A. Hurkens","year":"1989","unstructured":"Hurkens, C.A., Shrijver, J.: On the size of systems of sets every t of which have an SDR, with an application to the worst-case ratio of heuristics for packing problems. SIAM Journal of Discrete Math.\u00a02(1), 68\u201372 (1989)","journal-title":"SIAM Journal of Discrete Math."},{"issue":"6","key":"50_CR9","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 ACM\u00a050(6), 795\u2013824 (2003)","journal-title":"Journal of ACM"},{"key":"50_CR10","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":"50_CR11","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 J. Discrete Math.\u00a023(1), 251\u2013264 (2008)","journal-title":"SIAM J. Discrete Math."},{"key":"50_CR12","doi-asserted-by":"crossref","unstructured":"Trevisan, L.: Non-approximability results for optimization problems on bounded degree instances. In: Proceedings of the 33rd Annual ACM Symposium on Theory of Computing, pp. 453\u2013461 (2001)","DOI":"10.1145\/380752.380839"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Computation"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-25591-5_50","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T06:11:42Z","timestamp":1561011102000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-25591-5_50"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642255908","9783642255915"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-25591-5_50","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}