A deterministic approximation algorithm for metric triangle packing
From MaRDI portal
Publication:6589849
DOI10.1016/J.TCS.2024.114699MaRDI QIDQ6589849
Publication date: 20 August 2024
Published in: Theoretical Computer Science (Search for Journal in Brave)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- An improved randomized approximation algorithm for maximum triangle packing
- Approximation algorithms for maximum dispersion
- Improved approximation algorithms for weighted 2-path partitions
- Partition into triangles on bounded degree graphs
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
- Packing triangles in low degree graphs and indifference graphs
- An approximation algorithm for maximum triangle packing
- A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
- On local search for weighted \(k\)-set packing
- The Design of Approximation Algorithms
- Approximating the $$k$$-Set Packing Problem by Local Improvements
- 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
- On the completeness of a generalized matching problem
- A randomized approximation algorithm for metric triangle packing
- An improved approximation for maximum weighted \(k\)-set packing
- Approximation algorithms for the maximum-weight cycle/path packing problems
- An improved approximation algorithm for metric triangle packing
This page was built for publication: A deterministic approximation algorithm for metric triangle packing
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6589849)
