{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T05:27:37Z","timestamp":1725600457016},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642226847"},{"type":"electronic","value":"9783642226854"}],"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-22685-4_31","type":"book-chapter","created":{"date-parts":[[2011,8,10]],"date-time":"2011-08-10T08:54:39Z","timestamp":1312966479000},"page":"343-353","source":"Crossref","is-referenced-by-count":4,"title":["Matching and P 2-Packing: Weighted Versions"],"prefix":"10.1007","author":[{"given":"Qilong","family":"Feng","sequence":"first","affiliation":[]},{"given":"Jianxin","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Jianer","family":"Chen","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"31_CR1","first-page":"732","volume-title":"Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms","author":"R. Bar-Yehuda","year":"2002","unstructured":"Bar-Yehuda, R., Halld\u00f3rsson, M., Naor, J., Shachnai, H., Shapira, I.: Scheduling split intervals. In: Proc. 13th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 732\u2013741. ACM Press, New York (2002)"},{"key":"31_CR2","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/j.dam.2004.07.003","volume":"146","author":"C. Bazgan","year":"2005","unstructured":"Bazgan, C., Hassin, R., Monnot, J.: Approximation algorithms for some vehicle routing problems. Discrete Appl. Math.\u00a0146, 27\u201342 (2005)","journal-title":"Discrete Appl. Math."},{"issue":"4","key":"31_CR3","doi-asserted-by":"publisher","first-page":"472","DOI":"10.1007\/s00453-008-9206-y","volume":"54","author":"J. Chen","year":"2008","unstructured":"Chen, J., Lu, S.: Improved parameterized set splitting algorithms: A probabilistic approach. Algorithmica\u00a054(4), 472\u2013489 (2008)","journal-title":"Algorithmica"},{"key":"31_CR4","doi-asserted-by":"publisher","first-page":"477","DOI":"10.1007\/s10107-003-0414-6","volume":"98","author":"K. Bontridder De","year":"2003","unstructured":"De Bontridder, K., Halld\u00f3rsson, B., Lenstra, J., Ravi, R., Stougie, L.: Approximation algorithms for the test cover problem. Math. Program, Ser. B\u00a098, 477\u2013491 (2003)","journal-title":"Math. Program, Ser. B"},{"key":"31_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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., Heggernes, P., Rosamond, F., Sloper, C., Telle, J.A.: Exact algorithms for 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":"31_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/978-3-642-02017-9_24","volume-title":"Theory and Applications of Models of Computation","author":"Q. Feng","year":"2009","unstructured":"Feng, Q., Liu, Y., Lu, S., Wang, J.: Improved deterministic algorithms for weighted matching and packing problems. In: Chen, J., Cooper, S.B. (eds.) TAMC 2009. LNCS, vol.\u00a05532, pp. 211\u2013220. Springer, Heidelberg (2009)"},{"key":"31_CR7","first-page":"434","volume-title":"Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms","author":"H. Gabow","year":"1990","unstructured":"Gabow, H.: Data structures for weighted matching and nearest common ancestoers. In: Proc. 1st Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 434\u2013443. ACM Press, New York (1990)"},{"issue":"4","key":"31_CR8","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10878-009-9230-0","volume":"18","author":"H. Fernau","year":"2009","unstructured":"Fernau, H., Raible, D.: A parameterized perspective on packing paths of length two. Journal of Combinatorial Optimization\u00a018(4), 319\u2013341 (2009)","journal-title":"Journal of Combinatorial Optimization"},{"key":"31_CR9","doi-asserted-by":"publisher","first-page":"971","DOI":"10.1016\/j.dam.2005.11.003","volume":"154","author":"R. Hassin","year":"2006","unstructured":"Hassin, R., Rubinstein, S.: An approximation algorithm for maximum triangle packing. Discrete Appl. Math.\u00a0154, 971\u2013979 (2006)","journal-title":"Discrete Appl. Math."},{"key":"31_CR10","first-page":"240","volume-title":"Proc. 10th Annual ACM Symposium on Theory of Computing","author":"P. Hell","year":"1978","unstructured":"Hell, P., Kirkpatrick, D.: On the complexity of a generalized matching problem. In: Mitzenmacher, M. (ed.) Proc. 10th Annual ACM Symposium on Theory of Computing, pp. 240\u2013245. ACM Press, New York (1978)"},{"key":"31_CR11","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"C. Hurkens","year":"1989","unstructured":"Hurkens, C., Schrijver, A.: On the size of systems of sets every t of which have an SDR, with application to worst case ratio of heuristics for packing problems. SIAM Journal on Discrete Mathmatics\u00a02, 68\u201372 (1989)","journal-title":"SIAM Journal on Discrete Mathmatics"},{"key":"31_CR12","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1016\/0020-0190(94)90105-8","volume":"49","author":"V. Kann","year":"1994","unstructured":"Kann, V.: Maximum bounded H-matching is MAX-SNP-complete. Information Processing Letters\u00a049, 309\u2013318 (1994)","journal-title":"Information Processing Letters"},{"key":"31_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1007\/978-3-540-70575-8_47","volume-title":"Automata, Languages and Programming","author":"I. Koutis","year":"2008","unstructured":"Koutis, I.: Faster algebraic algorithms for path and packing problems. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 575\u2013586. Springer, Heidelberg (2008)"},{"key":"31_CR14","doi-asserted-by":"publisher","first-page":"601","DOI":"10.1137\/0212040","volume":"12","author":"D.G. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G., Hell, P.: On the complexity of general graph factor problems. SIAM Journal on Computing\u00a012, 601\u2013609 (1983)","journal-title":"SIAM Journal on Computing"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"van Leeuwen, J.: Graph algorithms. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol.\u00a0A, pp. 525\u2013631 (1990)","DOI":"10.1016\/B978-0-444-88071-0.50015-1"},{"key":"31_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/978-3-540-69507-3_36","volume-title":"SOFSEM 2007: Theory and Practice of Computer Science","author":"J. Monnot","year":"2007","unstructured":"Monnot, J., Toulouse, S.: The P\n                \n                  k\n                 partitioning problem and related problems in bipartite graphs. In: van Leeuwen, J., Italiano, G.F., van der Hoek, W., Meinel, C., Sack, H., Pl\u00e1\u0161il, F. (eds.) SOFSEM 2007. LNCS, vol.\u00a04362, pp. 422\u2013433. Springer, Heidelberg (2007)"},{"key":"31_CR17","first-page":"182","volume-title":"Proc. 39th Annual Symposium on Foundatins of Computer Science","author":"M. Naor","year":"1995","unstructured":"Naor, M., Schulman, L., Srinivasan, A.: Splitters and near-optimal derandomization. In: Proc. 39th Annual Symposium on Foundatins of Computer Science, pp. 182\u2013190. IEEE Press, New York (1995)"},{"key":"31_CR18","doi-asserted-by":"publisher","first-page":"437","DOI":"10.1016\/j.tcs.2005.10.009","volume":"351","author":"E. Prieto","year":"2006","unstructured":"Prieto, E., Sloper, C.: Looking at the stars. Theoretical Computer Science\u00a0351, 437\u2013445 (2006)","journal-title":"Theoretical Computer Science"},{"key":"31_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/978-3-540-79228-4_7","volume-title":"Theory and Applications of Models of Computation","author":"J. Wang","year":"2008","unstructured":"Wang, J., Feng, Q.: An O\n                *(3.523k\n                ) parameterized algorithm for 3-set packing. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 82\u201393. Springer, Heidelberg (2008)"},{"key":"31_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-540-79228-4_19","volume-title":"Theory and Applications of Models of Computation","author":"J. Wang","year":"2008","unstructured":"Wang, J., Ning, D., Feng, Q., Chen, J.: An improved parameterized algorithm for a generalized matching problem. In: Agrawal, M., Du, D.-Z., Duan, Z., Li, A. (eds.) TAMC 2008. LNCS, vol.\u00a04978, pp. 212\u2013222. Springer, Heidelberg (2008)"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22685-4_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T03:59:01Z","timestamp":1548475141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22685-4_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642226847","9783642226854"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22685-4_31","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}