Improved approximation algorithms for some min-max and minimum cycle cover problems
From MaRDI portal
Recommendations
- Improved approximation algorithms for min-max and minimum vehicle routing problems
- New approximation algorithms for the minimum cycle cover problem
- New approximation algorithms for the minimum cycle cover problem
- scientific article; zbMATH DE number 1875429
- scientific article; zbMATH DE number 1947046
Cites work
- Algorithms and Computation
- Approximating the minmax rooted-tree cover in a tree
- 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 algorithms for the multi-vehicle scheduling problem
- 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
- 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.
- Minmax tree cover in the Euclidean space
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
Cited in
(30)- The \(m\)-Steiner traveling salesman problem with online edge blockages
- An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem
- A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
- 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
- Better approximability results for min-max tree/cycle/path cover problems
- Approximation algorithms for distance constraint sweep coverage with base stations
- Improved approximation algorithms for the Min-Max selecting items problem
- Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems
- 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
- scientific article; zbMATH DE number 1875429 (Why is no real title available?)
- New approximation algorithms for the minimum cycle cover problem
- Approximation algorithms for some min-max and minimum stacker crane cover problems
- New approximation algorithms for the rooted budgeted cycle cover problem
- Approximation algorithms for some minimum postmen cover problems
- New approximation algorithms for the minimum cycle cover problem
- Improved approximation algorithms for minimum power covering problems
- New approximation algorithms for the rooted budgeted cycle cover problem
- New LP relaxations for minimum cycle/path/tree cover problems
- Scheduling on a graph with release times
- Approximation algorithms for solving the trip-constrained vehicle routing cover problems
- Approximation algorithms for the capacitated min-max and minimum graph cover problems
- Approximating graphic min-max and minimum cycle/path/tree cover problems
- A strongly polynomial time approximation algorithm for the min-max clustered cycle cover problem
- Approximation algorithms for the capacitated min-max and minimum graph cover problems
- Approximation algorithm for the min-max partial tree cover problem
- Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
This page was built for publication: Improved approximation algorithms for some min-max and minimum cycle cover problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q344767)
