A 2log2(n)-Approximation Algorithm for Directed Tour Cover

DOI10.1007/978-3-642-02026-1_19MaRDI QIDQ3637067zbMATH OpenOpenAlexFDO

Authors Viet Hung Nguyen

Publication date 7 July 2009

Published in Combinatorial Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-02026-1_19

Mathematics Subject Classification ID

Graph algorithms (graph-theoretic aspects) (05C85) Approximation algorithms (68W25) Combinatorial optimization (90C27)

Recommendations

• Approximating the minimum tour cover of a digraph
• Approximation algorithm for the minimum directed tree cover
• Approximating the Minimum Tour Cover with a Compact Linear Program
• Approximating the tree and tour covers of a graph
• scientific article; zbMATH DE number 1947046

Cited in

(2)

• Approximating the asymmetric profitable tour
• Approximation algorithm for the minimum directed tree cover

This page was built for publication: A 2log2(n)-Approximation Algorithm for Directed Tour Cover

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