Approximation Algorithms for the Asymmetric Postman Problem


The asymmetric postman problem is a generalization of the Chinese postman problem in which the edgetraversal costs are asymmetric. The problem is to compute a shortest tour that traverses every edge of a given graph at least once, and it is known to be NPhard. An approximation algorithm with a performance ratio of $ for the asymmetric postman problem is presented.

2 Figures and Tables

Cite this paper

@inproceedings{Raghavachari1999ApproximationAF, title={Approximation Algorithms for the Asymmetric Postman Problem}, author={Balaji Raghavachari and Jeyakesavan Veerasamy}, booktitle={SODA}, year={1999} }