Chinese Postman and Euler Tour Problems in Bi-Directed Graphs
Euler tours occupy an interesting position in the history of graph theory. Current interest in this area is due to problems involving tours where service is required along arcs of the tour rather than at nodes. Examples of problems of this type involve mail delivery, snow removal, street cleaning, trash pickup, etc. In considering such problems involving city streets, the nodes are intersections and the arcs are roadways between intersections. However, there are one-way streets and two-way streets. If the service must be done on both sides of a two-way street then two one-way streets (one in each direction) can replace it. However, there are situations where the street, even though two-way, need only be traversed once. For example, mail delivery in a more rural or suburban setting may require traversing the street or road only once. In a rural road, mail delivery is frequently done on one side of the road, and those who live on the other side must cross the road to get their mail. In setting up the routes, though, the road could be traversed in either direction. Thus, we consider graphs with two types of connections: directed and undirected. Other postman problems  have been considered.
KeywordsSpan Tree Dual Graph Euler Tour Mixed Graph Bipartite Subgraph
Unable to display preview. Download preview PDF.
- M. Conforti, G. Cornujols, A. Kapoor and K. Vuskovic, “Perfect, Ideal and Balanced Matrices”, (1996).Google Scholar
- Cornuéjols, G. “Combinatorial Optimization: Packing and Covering”, Lecture Notes, Carrnegie Mellon University, May 1999.Google Scholar
- Cornuéjols, G. and B. Guenin, “On Ideal Binary Clutters and a Conjecture of Seymour”, in preparation.Google Scholar
- Edmonds, J. “The Chinese Postman Problem”, Operations Research 13, Suppl. 1, pp. 373, 1965.Google Scholar
- Edmonds, J. and E.L. Johnson, “Matching: A Well-Solved Class of Integer Linear Programs”, Combinatorial Structures and Their Applications, proceedings from Calgary, Alberta, Canada, June 1969, pp. 89–92.Google Scholar
- Edmonds, J. and R.M. Karp, “Theoretical Improvements in Algorithmic Efficiency for Network Flow Problems”, Combinatorial Structures and Their Applications, proceedings from Calgary, Alberta, Canada, June 1969, pp. 93–96.Google Scholar
- Eiselt, H.A. and G. Laporte, “A Historical Perspective on Arc Routing”, this volume.Google Scholar
- Fulkerson, D.R. “Blocking Polyhedra,” in B. Harris, ed., Graph Theory and its Applications (Academic Press, NY), pp. 93–112, 1970.Google Scholar
- Guan, M. “Graphic Programming Using Odd or Even Points”, Chinese Mathematics 1 (1962), pp. 273–377.Google Scholar
- Khachian, L.G. “A Polynomial Algorithm in Linear Programming”, Soviet Mathematics Doklady 20 pp. 191–194, 1979.Google Scholar
- Roberts, F.S. and J. Spencer, “A Characterization of Clique Graphs”, Combinatorial Structures and Their Applications, proceedings from Calgary, Alberta, Canada, June 1969, pp. 367–368.Google Scholar
- Stone, A.H. “Some Combinatorial Problems in General Topology”, Combinatorial Structures and Their Applications, proceedings from Calgary, Alberta, Canada, June 1969, pp. 413–416.Google Scholar