Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing

DOI10.1016/J.DAM.2010.01.011MaRDI QIDQ708336zbMATH OpenOpenAlexFDO

Authors Zhi-Zhong Chen, Ruka Tanahashi, Lusheng Wang

Publication date 11 October 2010

Published in Discrete Applied Mathematics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.dam.2010.01.011

Mathematics Subject Classification ID

Combinatorial aspects of packing and covering (05B40) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Randomized algorithms (68W20) Approximation algorithms (68W25) Analysis of algorithms (68W40)

Recommendations

• An improved randomized approximation algorithm for maximum triangle packing
• An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
• A randomized approximation algorithm for metric triangle packing
• A randomized approximation algorithm for metric triangle packing
• A note on the random greedy triangle-packing algorithm
• Algorithms – ESA 2004
• An approximation algorithm for maximum triangle packing
• Corrigendum to: Approximating minimum-area rectangular and convex containers for packing convex polygons
• Erratum: An O(n\log \log n)-Time Algorithm for Triangulating a Simple Polygon

Cites work

• Erratum to ``An approximation algorithm for maximum triangle packing

Cited in

(13)

• Improved approximation algorithms for weighted 2-path partitions
• Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
• Improved approximation algorithms for weighted 2-path partitions
• An Improved Randomized Approximation Algorithm for Maximum Triangle Packing
• Erratum to: ``On regularity lemmas and their algorithmic applications
• A randomized approximation algorithm for metric triangle packing
• Approximation algorithms for the maximum-weight cycle/path packing problems
• Improved approximation algorithms for cycle and path packings
• A deterministic approximation algorithm for metric triangle packing
• An improved approximation algorithm for metric triangle packing
• Approximating the maximum weight cycle/path partition in graphs with weights one and two
• Approximating the maximum weight cycle/path partition in graphs with weights one and two
• Approximation algorithms for cycle and path partitions in complete graphs

This page was built for publication: Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q708336)