Approximation algorithms for the asymmetric postman problem

Authors:
Balaji Raghavachari;Jeyakesavan Veerasamy
Affiliations:
Department of Computer Science, The University of Texas at Dallas, Richardson, TX;Department of Computer Science, The University of Texas at Dallas and Samsung Telecommunications America, Inc.
Venue:
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Year:
1999

Integer and combinatorial optimization

Integer and combinatorial optimization
On the windy postman problem on Eulerian graphs

Mathematical Programming: Series A and B
A cutting plane algorithm for the windy postman problem

Mathematical Programming: Series A and B
Algorithms for the windy postman problem

Computers and Operations Research
Finding Postal Carrier Walk Paths in Mixed Graphs

Computational Optimization and Applications
On the complexity of edge traversing

Journal of the ACM (JACM)
Approximation Algorithms for Some Postman Problems

Journal of the ACM (JACM)
The Chinese Postman Problem for Mixed Graphs

WG '80 Proceedings of the International Workshop on Graphtheoretic Concepts in Computer Science

Hi-index	0.00