Approximation algorithm for min-max cycle cover problem on a mixed graph

DOI10.15960/J.CNKI.ISSN.1007-6093.2021.01.010MaRDI QIDQ5153435zbMATH OpenFDO

Authors Xiaoguang Bao, Chao Lu, Wei Yu, Dongmei Huang

Publication date 29 September 2021

Full work available at URL https://doi.org/10.15960/J.CNKI.ISSN.1007-6093.2021.01.010

zbMATH Keywords

approximation algorithmChinese postman problemmin-max cycle covermixed graphrural postman problemtraveling salesman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Minimax problems in mathematical programming (90C47) Approximation methods and heuristics in mathematical programming (90C59)

Recommendations

• A 3/2-Approximation Algorithm for the Mixed Postman Problem
• Approximation algorithms for solving the constrained arc routing problem in mixed graphs
• scientific article; zbMATH DE number 1187150
• Approximation algorithms for a mixed postman problem with restrictions on the arcs
• Minimum-Weight Cycle Covers and Their Approximability

Cited in

(4)

• A branch-and-cut algorithm for the maximum covering cycle problem
• An optimal strategy for the constrained cycle cover problem
• Approximation algorithms for some min-max and minimum stacker crane cover problems
• Approximation algorithms for some min-max and minimum stacker crane cover problems

This page was built for publication: Approximation algorithm for min-max cycle cover problem on a mixed graph

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5153435)