New approximation algorithms for the minimum cycle cover problem
From MaRDI portal
Recommendations
- New approximation algorithms for the minimum cycle cover problem
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- Minimum-Weight Cycle Covers and Their Approximability
- Minimum-weight cycle covers and their approximability
- scientific article; zbMATH DE number 1875429
Cites work
- Approximation algorithms for distance constrained vehicle routing problems
- Approximation Algorithms for Min-Max Cycle Cover Problems
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Approximation results for a min-max location-routing problem
- Approximation results for min-max path cover problems in vehicle routing
- Approximations for minimum and min-max vehicle routing problems
- scientific article; zbMATH DE number 3639144 (Why is no real title available?)
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Min-max cover of a graph with a small number of parts
- Min-max tree covers of graphs.
- Minimum Vehicle Routing with a Common Deadline
Cited in
(25)- A parallel algorithm for approximating the minimum cycle cover
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- An overview of graph covering and partitioning
- Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity
- New LP relaxations for minimum cycle/path/tree cover problems
- Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles
- An optimal strategy for the constrained cycle cover problem
- Constant-factor approximations for cycle cover problems
- Improved approximation algorithms for min-max and minimum vehicle routing problems
- Improved approximation algorithms for some min-max and minimum cycle cover problems
- scientific article; zbMATH DE number 1947046 (Why is no real title available?)
- A fast (2 + 2/7)-approximation algorithm for capacitated cycle covering
- Length-constrained cycle partition with an application to UAV routing*
- A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
- New approximation algorithms for the minimum cycle cover problem
- New approximation algorithms for the rooted budgeted cycle cover problem
- Approximation algorithms for some minimum postmen cover problems
- New approximation algorithms for the rooted budgeted cycle cover problem
- New LP relaxations for minimum cycle/path/tree cover problems
- New approximation algorithms for minimum cycle bases of graphs
- Approximation algorithms for the airport and railway problem
- Approximation algorithms for the airport and railway problem
- Forest covers
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
This page was built for publication: New approximation algorithms for the minimum cycle cover problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5919633)
