Next: MINIMUM K-CHINESE POSTMAN PROBLEM
Up: Routing Problems
Previous: MINIMUM METRIC BOTTLENECK WANDERING
for each .
A cycle in G (possibly containing repeated vertices) that includes each
directed and undirected edge at least once, traversing directed edges only
in the specified direction.
The total length of the cycle.
- Good News:
Approximable within 3/2 .
- Garey and Johnson: ND25