Approximation algorithms for the min-max mixed rural postmen cover problem and its variants

DOI10.1007/S00453-023-01187-ZMaRDI QIDQ6130323

Liting Huang, Zhaohui Liu, Wei Yu

Publication date: 2 April 2024

Published in: Algorithmica (Search for Journal in Brave)

zbMATH Keywords

approximation algorithmstacker crane problemmixed Chinese postman problemmixed rural postman problempostmen cover

Mathematics Subject Classification ID

Algorithms in computer science (68Wxx) Graph theory (05Cxx)

Cites Work

• Unnamed Item
• Unnamed Item
• Approximation hardness of min-max tree covers
• Solving the mobile mapping van problem: a hybrid metaheuristic for capacitated arc routing with soft time windows
• Synchronized arc routing for snow plowing operations
• Approximation algorithms for some min-max postmen cover problems
• Better approximability results for min-max tree/cycle/path cover problems
• A tabu search algorithm for the Min-Max \(k\)-Chinese postman problem
• Min-Max K -vehicles windy rural postman problem
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• On the complexity of edge traversing
• On general routing problems
• A fundamental problem in vehicle routing
• Approximation Algorithms for Some Postman Problems
• Security routing games with multivehicle Chinese postman problem
• A 3/2-Approximation Algorithm for the Mixed Postman Problem
• Matching, Euler tours and the Chinese postman
• Arc Routing Problems, Part I: The Chinese Postman Problem
• A Constant-factor Approximation Algorithm for the Asymmetric Traveling Salesman Problem
• Approximations for minimum and min-max vehicle routing problems
• An Improved Approximation Algorithm for The Asymmetric Traveling Salesman Problem
• Approximation algorithms for some min-max and minimum stacker crane cover problems

This page was built for publication: Approximation algorithms for the min-max mixed rural postmen cover problem and its variants