Improved approximation algorithms for some min-max and minimum cycle cover problems
From MaRDI portal
Publication:344767
DOI10.1016/j.tcs.2016.01.041zbMath1359.90125OpenAlexW2258629489MaRDI QIDQ344767
Publication date: 24 November 2016
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2016.01.041
Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Combinatorial optimization (90C27) Approximation algorithms (68W25)
Related Items (13)
Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity ⋮ Approximation algorithms for the min-max clustered \(k\)-traveling salesmen problems ⋮ Better approximability results for min-max tree/cycle/path cover problems ⋮ Approximation algorithms for distance constraint sweep coverage with base stations ⋮ Scheduling on a graph with release times ⋮ New approximation algorithms for the minimum cycle cover problem ⋮ New LP relaxations for minimum cycle/path/tree cover problems ⋮ The \(m\)-Steiner traveling salesman problem with online edge blockages ⋮ 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 ⋮ An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem ⋮ A fast \((2 + \frac{2}{7})\)-approximation algorithm for capacitated cycle covering
Cites Work
- Improved approximation algorithms for the MIN-MAX tree cover and bounded tree cover problems
- Min-max tree covers of graphs.
- Approximation results for a min-max location-routing problem
- Min-max cover of a graph with a small number of parts
- 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 the Multi-Vehicle Scheduling Problem
- Approximation results for min-max path cover problems in vehicle routing
- Polynomial time approximation schemes for Euclidean traveling salesman and other geometric problems
- Algorithms and Computation
- Approximation algorithms for regret-bounded vehicle routing and applications to distance-constrained vehicle routing
- Approximations for minimum and min-max vehicle routing problems
- Minmax Tree Cover in the Euclidean Space
This page was built for publication: Improved approximation algorithms for some min-max and minimum cycle cover problems
