{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,24]],"date-time":"2026-01-24T04:08:50Z","timestamp":1769227730647,"version":"3.49.0"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319091730","type":"print"},{"value":"9783319091747","type":"electronic"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-09174-7_35","type":"book-chapter","created":{"date-parts":[[2014,7,21]],"date-time":"2014-07-21T05:42:05Z","timestamp":1405921325000},"page":"408-420","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":21,"title":["Approximating the $$k$$-Set Packing Problem by Local Improvements"],"prefix":"10.1007","author":[{"given":"Martin","family":"F\u00fcrer","sequence":"first","affiliation":[]},{"given":"Huiwen","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2014,7,22]]},"reference":[{"issue":"4\/5","key":"35_CR1","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1007\/BF01940874","volume":"16","author":"N Alon","year":"1996","unstructured":"Alon, N., Naor, M.: Derandomization, witnesses for boolean matrix multiplication and construction of perfect hash functions. Algorithmica 16(4\/5), 434\u2013449 (1996)","journal-title":"Algorithmica"},{"issue":"4","key":"35_CR2","doi-asserted-by":"publisher","first-page":"844","DOI":"10.1145\/210332.210337","volume":"42","author":"N Alon","year":"1995","unstructured":"Alon, N., Yuster, R., Zwick, U.: Color-coding. J. ACM 42(4), 844\u2013856 (1995)","journal-title":"J. ACM"},{"issue":"3","key":"35_CR3","first-page":"178","volume":"7","author":"P Berman","year":"2000","unstructured":"Berman, P.: A d\/2 approximation for maximum weight independent set in d-claw free graphs. Nord. J. Comput. 7(3), 178\u2013184 (2000)","journal-title":"Nord. J. Comput."},{"key":"35_CR4","unstructured":"Berman, P., F\u00fcrer, M.: Approximating maximum independent set in bounded degree graphs. In: SODA, pp. 365\u2013371 (1994)"},{"key":"35_CR5","doi-asserted-by":"crossref","unstructured":"Chan, Y., Lau, L.: On linear and semidefinite programming relaxations for hypergraph matching. In: SODA, pp. 1500\u20131511 (2010)","DOI":"10.1137\/1.9781611973075.122"},{"key":"35_CR6","unstructured":"Chandra, B., Halld\u00f3rsson, M.: Greedy local improvement and weighted set packing approximation. In: SODA, pp. 169\u2013176 (1999)"},{"key":"35_CR7","doi-asserted-by":"crossref","unstructured":"Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: FOCS, pp. 509\u2013518 (2013)","DOI":"10.1109\/FOCS.2013.61"},{"key":"35_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M., Grandoni, F., Mastrolilli, M.: How to sell hyperedges: the hypermatching assignment problem. In: SODA, pp. 342\u2013351 (2013)","DOI":"10.1137\/1.9781611973105.25"},{"issue":"2","key":"35_CR9","doi-asserted-by":"publisher","first-page":"167","DOI":"10.1007\/s00453-007-9146-y","volume":"52","author":"MR Fellows","year":"2008","unstructured":"Fellows, M.R., Knauer, C., Nishimura, N., Ragde, P., Rosamond, F., Stege, U., Thilikos, D.M., Whitesides, S.: Faster fixed-parameter tractable algorithms for matching and packing problems. Algorithmica 52(2), 167\u2013176 (2008)","journal-title":"Algorithmica"},{"key":"35_CR10","unstructured":"F\u00fcrer, M., Yu, H.: Approximating the k-set packing problem by local improvements. http:\/\/arxiv.org\/abs\/1307.2262"},{"key":"35_CR11","unstructured":"Halld\u00f3rsson, M.: Approximating discrete collections via local improvements. In: SODA, pp. 160\u2013169 (1995)"},{"key":"35_CR12","doi-asserted-by":"crossref","unstructured":"H\u00e5stad, J.: Clique is hard to approximate within $$n^{1-\\epsilon }$$. In: FOCS, pp. 627\u2013636 (1996)","DOI":"10.1109\/SFCS.1996.548522"},{"issue":"1","key":"35_CR13","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. Comput. Complex. 15(1), 20\u201339 (2006)","journal-title":"Comput. Complex."},{"issue":"1","key":"35_CR14","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CA 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 J. Discrete Math. 2(1), 68\u201372 (1989)","journal-title":"SIAM J. Discrete Math."},{"key":"35_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"792","DOI":"10.1007\/978-3-642-39206-1_67","volume-title":"Automata, Languages, and Programming","author":"M Sviridenko","year":"2013","unstructured":"Sviridenko, M., Ward, J.: Large neighborhood local search for the maximum set packing problem. In: Fomin, F.V., Freivalds, R., Kwiatkowska, M., Peleg, D. (eds.) ICALP 2013, Part I. LNCS, vol. 7965, pp. 792\u2013803. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-09174-7_35","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,3]],"date-time":"2025-05-03T21:51:43Z","timestamp":1746309103000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-09174-7_35"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319091730","9783319091747"],"references-count":15,"aliases":["10.1007\/978-3-319-14115-2_35"],"URL":"https:\/\/doi.org\/10.1007\/978-3-319-09174-7_35","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"22 July 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}