An improved approximation algorithm for metric triangle packing
From MaRDI portal
Cites work
- A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
- A randomized approximation algorithm for metric triangle packing
- An approximation algorithm for maximum triangle packing
- An improved approximation for maximum weighted \(k\)-set packing
- An improved randomized approximation algorithm for maximum triangle packing
- Approximating the k-set packing problem by local improvements
- Approximation algorithms for maximum dispersion
- Approximation algorithms for the maximum-weight cycle/path packing problems
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
- Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- scientific article; zbMATH DE number 1262785 (Why is no real title available?)
- scientific article; zbMATH DE number 2011853 (Why is no real title available?)
- scientific article; zbMATH DE number 910871 (Why is no real title available?)
- Improved approximation algorithms for weighted 2-path partitions
- Maximum bounded 3-dimensional matching is MAX SNP-complete
- On local search for weighted \(k\)-set packing
- On the completeness of a generalized matching problem
- 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
- Packing triangles in low degree graphs and indifference graphs
- Partition into triangles on bounded degree graphs
- The design of approximation algorithms
This page was built for publication: An improved 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 Q6636067)
