Abstract
We present a randomized ( 89 169 - ε ) -approximation algorithm for the weighted maximum triangle packing problem, for any given ε > 0 . This is the first algorithm for this problem whose performance guarantee is better than 1 2 . The algorithm also improves the best-known approximation bound for the maximum 2-edge path packing problem.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
