The following pages link to (Q4796177):
Displaying 4 items.
- The multiple traveling salesman problem on spiders (Q831830) (← links)
- A \(\frac{5}{3}\)-approximation algorithm for scheduling vehicles on a path with release and handling times (Q1007578) (← links)
- A faster 2-approximation algorithm for the minmax \(p\)-traveling salesmen problem on a tree (Q1827840) (← links)
- Minmax Tree Cover in the Euclidean Space (Q5901435) (← links)