New approximation algorithms for the minimum cycle cover problem

DOI10.1007/978-3-319-78455-7_7MaRDI QIDQ5896084zbMATH OpenOpenAlexFDO

Authors Wei Yu, Zhaohui Liu, Xiaoguang Bao

Publication date 7 July 2020

Published in Frontiers in Algorithmics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-319-78455-7_7

zbMATH Keywords

approximation algorithmtraveling salesman problemvehicle routingcycle cover

Mathematics Subject Classification ID

Analysis of algorithms (68W40) Combinatorial optimization (90C27) Approximation algorithms (68W25) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)

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

Cited in

(10)

• Improved approximation algorithms for min-max and minimum vehicle routing problems
• Improved approximation algorithms for metric maximum ATSP and maximum 3-cycle cover problems
• An optimal strategy for the constrained cycle cover problem
• New approximation algorithms for minimum cycle bases of graphs
• STACS 2005
• New LP relaxations for minimum cycle/path/tree cover problems
• A New Algorithm for Finding Minimal Cycle-Breaking Sets of Turns in a Graph
• Improved approximation algorithms for some min-max and minimum cycle cover problems
• New approximation algorithms for the minimum cycle cover problem
• New LP relaxations for minimum cycle/path/tree 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 Q5896084)