{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T14:15:25Z","timestamp":1742912125833,"version":"3.40.3"},"publisher-location":"Singapore","reference-count":29,"publisher":"Springer Nature Singapore","isbn-type":[{"type":"print","value":"9789819723393"},{"type":"electronic","value":"9789819723409"}],"license":[{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2024,1,1]],"date-time":"2024-01-01T00:00:00Z","timestamp":1704067200000},"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":[[2024]]},"DOI":"10.1007\/978-981-97-2340-9_5","type":"book-chapter","created":{"date-parts":[[2024,5,2]],"date-time":"2024-05-02T23:01:51Z","timestamp":1714690911000},"page":"50-62","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Improved Approximation Algorithm for\u00a0Metric Triangle Packing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-2322-750X","authenticated-orcid":false,"given":"Jingyang","family":"Zhao","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-1012-2373","authenticated-orcid":false,"given":"Mingyu","family":"Xiao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2024,5,3]]},"reference":[{"issue":"3","key":"5_CR1","doi-asserted-by":"publisher","first-page":"640","DOI":"10.1287\/moor.23.3.640","volume":"23","author":"EM Arkin","year":"1998","unstructured":"Arkin, E.M., Hassin, R.: On local search for weighted $$k$$-set packing. Math. Oper. Res. 23(3), 640\u2013648 (1998)","journal-title":"Math. Oper. Res."},{"key":"5_CR2","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/j.dam.2017.11.031","volume":"239","author":"A Bar-Noy","year":"2018","unstructured":"Bar-Noy, A., Peleg, D., Rabanca, G., Vigan, I.: Improved approximation algorithms for weighted 2-path partitions. Discrete Appl. Math. 239, 15\u201337 (2018)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"5_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."},{"issue":"1","key":"5_CR4","doi-asserted-by":"publisher","first-page":"12","DOI":"10.1007\/s10878-020-00660-7","volume":"41","author":"Y Chen","year":"2021","unstructured":"Chen, Y., Chen, Z., Lin, G., Wang, L., Zhang, A.: A randomized approximation algorithm for metric triangle packing. J. Comb. Optim. 41(1), 12\u201327 (2021)","journal-title":"J. Comb. Optim."},{"issue":"7","key":"5_CR5","doi-asserted-by":"publisher","first-page":"1640","DOI":"10.1016\/j.dam.2008.11.009","volume":"157","author":"Z Chen","year":"2009","unstructured":"Chen, Z., Tanahashi, R., Wang, L.: An improved randomized approximation algorithm for maximum triangle packing. Discrete Appl. Math. 157(7), 1640\u20131646 (2009)","journal-title":"Discrete Appl. Math."},{"key":"5_CR6","doi-asserted-by":"crossref","unstructured":"Chen, Z., Tanahashi, R., Wang, L.: Erratum to \u201can improved randomized approximation algorithm for maximum triangle packing\" [Discrete Appl. Math. 157 (2009) 1640\u20131646]. Discrete Appl. Math. 158(9), 1045\u20131047 (2010)","DOI":"10.1016\/j.dam.2010.01.011"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximation hardness for small occurrence instances of NP-hard problems. In: CIAC 2003, vol.\u00a02653, pp. 152\u2013164 (2003)","DOI":"10.1007\/3-540-44849-7_21"},{"key":"5_CR8","doi-asserted-by":"crossref","unstructured":"Cygan, M.: Improved approximation for 3-dimensional matching via bounded pathwidth local search. In: FOCS 2013, pp. 509\u2013518. IEEE Computer Society (2013)","DOI":"10.1109\/FOCS.2013.61"},{"key":"5_CR9","doi-asserted-by":"publisher","first-page":"408","DOI":"10.1007\/978-3-319-09174-7_35","volume-title":"ISCO 2014","author":"M F\u00fcrer","year":"2014","unstructured":"F\u00fcrer, M., Yu, H.: Approximating the $$k$$-set packing problem by local improvements. In: Fouilhoux, P., Gouveia, L., Mahjoub, A., Paschos, V. (eds.) ISCO 2014. LNCS, vol. 8596, pp. 408\u2013420. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-09174-7_35"},{"key":"5_CR10","unstructured":"Gabow, H.N.: Implementation of algorithms for maximum matching on nonbipartite graphs. Ph.D. thesis, Stanford University (1974)"},{"key":"5_CR11","unstructured":"Garey, M.R., Johnson, D.S.: Computers and Intractability: A Guide to the Theory of NP-Completeness. W. H. Freeman (1979)"},{"key":"5_CR12","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/10692760_3","volume-title":"WG 1998","author":"V Guruswami","year":"1998","unstructured":"Guruswami, V., Rangan, C.P., Chang, M., Chang, G.J., Wong, C.K.: The vertex-disjoint triangles problem. In: Hromkovi\u010d, J., S\u00fdkora, O. (eds.) WG 1998. LNCS, vol. 1517, pp. 26\u201337. Springer, Heidelberg (1998). https:\/\/doi.org\/10.1007\/10692760_3"},{"key":"5_CR13","unstructured":"Halld\u00f3rsson, M.M.: Approximating discrete collections via local improvements. In: SODA 1995, pp. 160\u2013169. ACM\/SIAM (1995)"},{"key":"5_CR14","unstructured":"Hartvigsen, D.: Extensions of matching theory. Ph.D. thesis, Carnegie-Mellon University (1984)"},{"issue":"6","key":"5_CR15","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. 154(6), 971\u2013979 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"18","key":"5_CR16","doi-asserted-by":"publisher","first-page":"2620","DOI":"10.1016\/j.dam.2006.05.005","volume":"154","author":"R Hassin","year":"2006","unstructured":"Hassin, R., Rubinstein, S.: Erratum to \u201can approximation algorithm for maximum triangle packing\u2019\u2019: [Discrete Applied Mathematics 154 (2006) 971\u2013979]. Discrete Appl. Math. 154(18), 2620 (2006)","journal-title":"Discrete Appl. Math."},{"issue":"3","key":"5_CR17","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1016\/S0167-6377(97)00034-5","volume":"21","author":"R Hassin","year":"1997","unstructured":"Hassin, R., Rubinstein, S., Tamir, A.: Approximation algorithms for maximum dispersion. Oper. Res. Lett. 21(3), 133\u2013137 (1997)","journal-title":"Oper. Res. Lett."},{"issue":"1","key":"5_CR18","doi-asserted-by":"publisher","first-page":"68","DOI":"10.1137\/0402008","volume":"2","author":"CAJ Hurkens","year":"1989","unstructured":"Hurkens, C.A.J., Schrijver, A.: 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."},{"issue":"1","key":"5_CR19","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1016\/0020-0190(91)90246-E","volume":"37","author":"V Kann","year":"1991","unstructured":"Kann, V.: Maximum bounded 3-dimensional matching is MAX SNP-complete. Inf. Process. Lett. 37(1), 27\u201335 (1991)","journal-title":"Inf. Process. Lett."},{"key":"5_CR20","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., Hell, P.: On the completeness of a generalized matching problem. In: STOC 1978, pp. 240\u2013245. ACM (1978)","DOI":"10.1145\/800133.804353"},{"key":"5_CR21","unstructured":"Lawler, E.: Combinatorial Optimization: Networks and Matroids. Holt, Rinehart and Winston (1976)"},{"key":"5_CR22","doi-asserted-by":"crossref","unstructured":"Li, S., Yu, W.: Approximation algorithms for the maximum-weight cycle\/path packing problems. Asia Pac. J. Oper. Res. 40(4), 2340003:1\u20132340003:16 (2023)","DOI":"10.1142\/S0217595923400031"},{"issue":"8","key":"5_CR23","doi-asserted-by":"publisher","first-page":"1455","DOI":"10.1016\/j.disc.2007.07.100","volume":"308","author":"G Manic","year":"2008","unstructured":"Manic, G., Wakabayashi, Y.: Packing triangles in low degree graphs and indifference graphs. Discrete Math. 308(8), 1455\u20131471 (2008)","journal-title":"Discrete Math."},{"key":"5_CR24","unstructured":"Neuwohner, M.: An improved approximation algorithm for the maximum weight independent set problem in d-claw free graphs. In: STACS 2021. LIPIcs, vol.\u00a0187, pp. 53:1\u201353:20. Schloss Dagstuhl - Leibniz-Zentrum f\u00fcr Informatik (2021)"},{"key":"5_CR25","doi-asserted-by":"crossref","unstructured":"van Rooij, J.M.M., van Kooten\u00a0Niekerk, M.E., Bodlaender, H.L.: Partition into triangles on bounded degree graphs. Theory Comput. Syst. 52(4), 687\u2013718 (2013)","DOI":"10.1007\/s00224-012-9412-5"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Thiery, T., Ward, J.: An improved approximation for maximum weighted $$k$$-set packing. In: SODA 2023, pp. 1138\u20131162. SIAM (2023)","DOI":"10.1137\/1.9781611977554.ch42"},{"key":"5_CR27","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921735","volume-title":"The Design of Approximation Algorithms","author":"DP Williamson","year":"2011","unstructured":"Williamson, D.P., Shmoys, D.B.: The Design of Approximation Algorithms. Cambridge University Press, Cambridge (2011)"},{"key":"5_CR28","doi-asserted-by":"crossref","unstructured":"Zhao, J., Xiao, M.: An improved approximation algorithm for metric triangle packing. CoRR abs\/2402.08216 (2024)","DOI":"10.1016\/j.tcs.2024.114699"},{"issue":"13\u201314","key":"5_CR29","doi-asserted-by":"publisher","first-page":"2142","DOI":"10.1016\/j.dam.2013.03.001","volume":"161","author":"A van Zuylen","year":"2013","unstructured":"van Zuylen, A.: Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems. Discrete Appl. Math. 161(13\u201314), 2142\u20132157 (2013)","journal-title":"Discrete Appl. Math."}],"container-title":["Lecture Notes in Computer Science","Theory and Applications of Models of Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-97-2340-9_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,11,17]],"date-time":"2024-11-17T23:17:36Z","timestamp":1731885456000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-981-97-2340-9_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024]]},"ISBN":["9789819723393","9789819723409"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-981-97-2340-9_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2024]]},"assertion":[{"value":"3 May 2024","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"TAMC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Annual Conference on Theory and Applications of Models of Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hong Kong","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2024","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2024","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 May 2024","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"tamc2024","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/tamc2024.comp.polyu.edu.hk\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}