Two approximation algorithms for 3-cycle covers
From MaRDI portal
Recommendations
Cited in
(7)- An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- A 6/5-Approximation Algorithm for the Maximum 3-Cover Problem
- A 2log2(n)-Approximation Algorithm for Directed Tour Cover
- Computing cycle covers without short cycles
- 35/44-approximation for asymmetric maximum TSP with triangle inequality
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
This page was built for publication: Two approximation algorithms for 3-cycle covers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4411276)