{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:33:39Z","timestamp":1725514419254},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540725039"},{"type":"electronic","value":"9783540725046"}],"license":[{"start":{"date-parts":[[2007,1,1]],"date-time":"2007-01-01T00:00:00Z","timestamp":1167609600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2007]]},"DOI":"10.1007\/978-3-540-72504-6_63","type":"book-chapter","created":{"date-parts":[[2007,7,22]],"date-time":"2007-07-22T07:36:39Z","timestamp":1185089799000},"page":"692-702","source":"Crossref","is-referenced-by-count":4,"title":["Parameterized Algorithms for Weighted Matching and Packing Problems"],"prefix":"10.1007","author":[{"given":"Yunlong","family":"Liu","sequence":"first","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"63_CR1","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. Journal of the ACM\u00a042, 844\u2013856 (1995)","journal-title":"Journal of the ACM"},{"key":"63_CR2","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1006\/jagm.2000.1155","volume":"39","author":"B. Chandra","year":"2001","unstructured":"Chandra, B., Halldorsson, M.: Greedy local improvement and weighted set packing approximation. Journal of Algorithms\u00a039, 223\u2013240 (2001)","journal-title":"Journal of Algorithms"},{"key":"63_CR3","unstructured":"Chen, J., et al.: Improved algorithms for path, matching, and packing problems. In: Proc. 18th Annual ACM-SIAM Symp. on Discrete Algorithms (SODA 07), pp. 298\u2013307 (2007)"},{"key":"63_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1007\/978-3-540-30559-0_20","volume-title":"Graph-Theoretic Concepts in Computer Science","author":"M. Fellows","year":"2004","unstructured":"Fellows, M., et al.: Finding k disjoint triangles in an arbitrary graph. In: Hromkovi\u010d, J., Nagl, M., Westfechtel, B. (eds.) WG 2004. LNCS, vol.\u00a03353, pp. 235\u2013244. Springer, Heidelberg (2004)"},{"key":"63_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1007\/978-3-540-30140-0_29","volume-title":"Algorithms \u2013 ESA 2004","author":"M.R. Fellows","year":"2004","unstructured":"Fellows, M.R., et al.: Faster Fixed-parameter tractable algorithms for matching and packing problems. In: Albers, S., Radzik, T. (eds.) ESA 2004. LNCS, vol.\u00a03221, pp. 311\u2013322. Springer, Heidelberg (2004)"},{"key":"63_CR6","unstructured":"Fernau, H.: Parameterized maximization. Technical Report WSI-2001-22, UniversityTubingen (Germany), Wilhelm-Schickard-Institut fur Informatik (2001)"},{"key":"63_CR7","volume-title":"Computers and Intractability: A Guide to the Theory of NP-Completeness","author":"M.R. Garey","year":"1979","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W.H. Freeman, New York (1979)"},{"key":"63_CR8","doi-asserted-by":"publisher","first-page":"608","DOI":"10.1016\/j.jda.2005.07.005","volume":"4","author":"J. Guo","year":"2006","unstructured":"Guo, J., Niedermeier, R.: Exact algorithms and applications for tree-like weighted set cover. Journal of Discrete Algorithms\u00a04, 608\u2013622 (2006)","journal-title":"Journal of Discrete Algorithms"},{"key":"63_CR9","doi-asserted-by":"publisher","first-page":"106","DOI":"10.1016\/j.jalgor.2003.07.001","volume":"50","author":"W. Jia","year":"2004","unstructured":"Jia, W., Zhang, C., Chen, J.: An efficient parameterized algorithm for m-Set Packing. Journal of Algorithms\u00a050, 106\u2013117 (2004)","journal-title":"Journal of Algorithms"},{"key":"63_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/11847250_8","volume-title":"Parameterized and Exact Computation","author":"Y. Liu","year":"2006","unstructured":"Liu, Y., et al.: Greedy localization and color-coding: improved matching and packing algorithms. In: Bodlaender, H.L., Langston, M.A. (eds.) IWPEC 2006. LNCS, vol.\u00a04169, pp. 84\u201395. Springer, Heidelberg (2006)"},{"key":"63_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/978-3-540-28639-4_12","volume-title":"Parameterized and Exact Computation","author":"L. Mathieson","year":"2004","unstructured":"Mathieson, L., Prieto, E., Shaw, P.: Packing edge disjoint triangles: a parameterized view. In: Downey, R.G., Fellows, M.R., Dehne, F. (eds.) IWPEC 2004. LNCS, vol.\u00a03162, pp. 127\u2013137. Springer, Heidelberg (2004)"}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72504-6_63","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,21]],"date-time":"2019-05-21T20:28:52Z","timestamp":1558470532000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72504-6_63"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007]]},"ISBN":["9783540725039","9783540725046"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72504-6_63","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2007]]}}}