Approximating the minimum tour cover of a digraph
From MaRDI portal
Publication:1736480
DOI10.3390/A4020075zbMATH Open1461.90161OpenAlexW2004947445MaRDI QIDQ1736480FDOQ1736480
Authors: 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
Recommendations
- Approximating the tree and tour covers of a graph
- Approximating the Minimum Tour Cover with a Compact Linear Program
- Approximating the Minimum Equivalent Digraph
- scientific article; zbMATH DE number 1003248
- An approximation of the minimum vertex cover in a graph
- scientific article; zbMATH DE number 1788255
- On the Complexity of Finding a Minimum Cycle Cover of a Graph
- scientific article; zbMATH DE number 1033814
- scientific article; zbMATH DE number 5631194
- scientific article; zbMATH DE number 1463390
Programming involving graphs or networks (90C35) Directed graphs (digraphs), tournaments (05C20) Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25)
Cites Work
- Improved approximations for tour and tree covers
- On the worst-case performance of some algorithms for the asymmetric traveling salesman problem
- An \(O(\log n/ \log \log n)\)-approximation algorithm for the asymmetric traveling salesman problem
- Approximation algorithms for asymmetric TSP by decomposing directed regular multigraphs
- Approximating the asymmetric profitable tour
- Title not available (Why is that?)
- Some remarks on Arc‐connectivity, vertex splitting, and orientation in graphs and digraphs
- On some connectivity properties of Eulerian graphs
- Approximating the tree and tour covers of a graph
Cited In (5)
This page was built for publication: Approximating the minimum tour cover of a digraph
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1736480)
