Approximation Algorithms for Min-Max Cycle Cover Problems

DOI10.1109/TC.2013.2295609zbMath1360.68907MaRDI QIDQ2982336

Weifa Liang, Wenzheng Xu, Xiaola Lin

Publication date: 16 May 2017

Published in: IEEE Transactions on Computers (Search for Journal in Brave)

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph theory (including graph drawing) in computer science (68R10) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)

Related Items (15)

An overview of graph covering and partitioning ⋮ Distance constrained vehicle routing problem to minimize the total cost: algorithms and complexity ⋮ Improved approximation algorithms for some min-max and minimum cycle cover problems ⋮ 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 ⋮ Approximation algorithms for some min-max and minimum stacker crane cover problems ⋮ 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 Multi-Robot Patrol-Scheduling with Min-Max Latency ⋮ New approximation algorithms for the rooted budgeted cycle cover problem ⋮ An asymptotically tight online algorithm for \(m\)-steiner traveling salesman problem

This page was built for publication: Approximation Algorithms for Min-Max Cycle Cover Problems