Next: MINIMUM K-STACKER CRANE PROBLEM
Up: Routing Problems
Previous: MINIMUM K-CHINESE POSTMAN PROBLEM
that for every arc there is a parallel edge of no greater length.
A cycle in G (possibly containing repeated vertices) that includes each
directed edge in A at least once, traversing such edges only in the
The total length of the cycle.
- Good News:
Approximable within 9/5 .
- Garey and Johnson: ND26