Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs

DOI10.1007/978-3-319-44003-3_5zbMath1354.90122OpenAlexW2508682799MaRDI QIDQ2958236

F. J. Zaragoza Martínez

Publication date: 1 February 2017

Published in: Studies in Computational Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-44003-3_5

zbMATH Keywords

approximation algorithmmixed graphpostman problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Combinatorial optimization (90C27)

Related Items (1)

Postman problems on series-parallel mixed graphs

Cites Work

• Unnamed Item
• Approximation algorithms for solving the constrained arc routing problem in mixed graphs
• The mixed postman problem
• On the windy postman problem
• On the mixed Chinese postman problem
• Recent results on Arc Routing Problems: An annotated bibliography
• Feasibility of the Mixed Postman Problem with Restrictions on the Edges
• On the complexity of edge traversing
• On general routing problems
• Approximation Algorithms for Some Postman Problems
• 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
• Arc Routing Problems, Part II: The Rural Postman Problem

This page was built for publication: Approximation Algorithms for a Mixed Postman Problem with Restrictions on the Arcs