Approximating the minimum tour cover of a digraph

DOI10.3390/a4020075zbMath1461.90161OpenAlexW2004947445MaRDI QIDQ1736480

Viet Hung Nguyen

Publication date: 26 March 2019

Published in: Algorithms (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.3390/a4020075

zbMATH Keywords

graph algorithmapproximation algorithmpacking and coveringtree covertour cover

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Directed graphs (digraphs), tournaments (05C20)

Related Items

The indefinite period traveling salesman problem

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Approximating the tree and tour covers of a graph
• Improved approximations for tour and tree covers
• Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
• Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
• On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
• On some connectivity properties of Eulerian graphs