Computing cycle covers without short cycles
From MaRDI portal
Recommendations
Cited in
(16)- Minimum-weight cycle covers and their approximability
- An overview of graph covering and partitioning
- An algorithm for the polyhedral cycle cover problem with constraints on the number and length of cycles
- Restricted cycle factors and arc-decompositions of digraphs
- TSP with bounded metrics
- Approximability of the minimum-weight \(k\)-size cycle cover problem
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- Approximation of Euclidean \(k\)-size cycle cover problem
- Minimum-Weight Cycle Covers and Their Approximability
- Approximation Algorithms for Restricted Cycle Covers Based on Cycle Decompositions
- Two approximation algorithms for 3-cycle covers
- Cycle cover with short cycles
- New approximation algorithms for the minimum cycle cover problem
- Approximation and Online Algorithms
- New approximation algorithms for the minimum cycle cover problem
- Constant-ratio polynomial time approximation of the asymmetric minimum weight cycle cover problem with limited number of cycles
This page was built for publication: Computing cycle covers without short cycles
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4796188)