{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T05:59:55Z","timestamp":1725515995161},"publisher-location":"Berlin, Heidelberg","reference-count":6,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540688655"},{"type":"electronic","value":"9783540688808"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-68880-8_11","type":"book-chapter","created":{"date-parts":[[2008,7,31]],"date-time":"2008-07-31T02:37:59Z","timestamp":1217471879000},"page":"97-108","source":"Crossref","is-referenced-by-count":4,"title":["An Improved Randomized Approximation Algorithm for Maximum Triangle Packing"],"prefix":"10.1007","author":[{"given":"Zhi-Zhong","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ruka","family":"Tanahashi","sequence":"additional","affiliation":[]},{"given":"Lusheng","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/3-540-44849-7_21","volume-title":"Algorithms and Complexity","author":"M. Chleb\u00edk","year":"2003","unstructured":"Chleb\u00edk, M., Chleb\u00edkov\u00e1, J.: Approximating Hardness for Small Occurrence Instances of NP-Hard Problems. In: Petreschi, R., Persiano, G., Silvestri, R. (eds.) CIAC 2003. LNCS, vol.\u00a02653, pp. 152\u2013164. Springer, Heidelberg (2003)"},{"key":"11_CR2","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. Freeman, New York (1979)"},{"key":"11_CR3","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 Applied Mathematics\u00a0154, 971\u2013979 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR4","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 gAn approximation algorithm for maximum triangle packingh: [Discrete Applied Mathematics 154 (2006) 971-979]. Discrete Applied Mathematics\u00a0154, 2620\u20132620 (2006)","journal-title":"Discrete Applied Mathematics"},{"key":"11_CR5","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. Information Processing Letters\u00a037, 27\u201335 (1991)","journal-title":"Information Processing Letters"},{"key":"11_CR6","first-page":"683","volume":"38","author":"P. Raghavan","year":"1994","unstructured":"Raghavan, P.: Probabilistic Construction of Deterministic Algorithms: Approximating Packing Integer Programs. Journal of Computer and System Sciences\u00a038, 683\u2013707 (1994)","journal-title":"Journal of Computer and System Sciences"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Aspects in Information and Management"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-68880-8_11.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T00:16:58Z","timestamp":1620001018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-68880-8_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540688655","9783540688808"],"references-count":6,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-68880-8_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[]}}