Improved approximation algorithms for cycle and path packings
From MaRDI portal
Cites work
- 8/7-approximation algorithm for (1,2)-TSP
- A 4/5 -- approximation algorithm for the maximum traveling salesman problem
- A \(\frac78\)-approximation algorithm for metric Max TSP
- A \(d/2\) approximation for maximum weight independent set in \(d\)-claw free graphs
- A local search algorithm for binary maximum 2-path partitioning
- A randomized approximation algorithm for metric triangle packing
- An approximation algorithm for maximum packing of 3-edge paths
- 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
- Approximation algorithms for maximum dispersion
- Approximation algorithms for the maximum-weight cycle/path packing problems
- Approximation results for the weighted \(P_4\) partition problem
- Deterministic 7/8-approximation for the metric maximum TSP
- Deterministic approximation algorithms for the maximum traveling salesman and maximum triangle packing problems
- Erratum to ``An approximation algorithm for maximum triangle packing
- Erratum to: ``An improved randomized approximation algorithm for maximum triangle packing
- scientific article; zbMATH DE number 3643026 (Why is no real title available?)
- Improved approximation algorithms for metric MaxTSP
- Improved approximation algorithms for weighted 2-path partitions
- On Approximating Restricted Cycle Covers
- On local search for weighted \(k\)-set packing
- On the completeness of a generalized matching problem
- Passing the limits of pure local search for weighted \(k\)-Set packing
- The design of approximation algorithms
- The limits of local search for weighted \(k\)-set packing
Cited in
(3)
This page was built for publication: Improved approximation algorithms for cycle and path packings
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6575393)
