An improved approximation algorithm for metric triangle packing
From MaRDI portal
Publication:6636067
DOI10.1007/978-981-97-2340-9_5MaRDI QIDQ6636067
Publication date: 12 November 2024
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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
- 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
Related Items (1)
This page was built for publication: An improved approximation algorithm for metric triangle packing
