# On the approximability of Time Disjoint Walks

@article{Bayen2020OnTA, title={On the approximability of Time Disjoint Walks}, author={A. Bayen and J. Goodman and Eugene Vinitsky}, journal={Journal of Combinatorial Optimization}, year={2020}, pages={1-22} }

We introduce the combinatorial optimization problem Time Disjoint Walks (TDW), which has applications in collision-free routing of discrete objects (e.g., autonomous vehicles) over a network. This problem takes as input a digraph $$G$$ with positive integer arc lengths, and $$k$$ pairs of vertices that each represent a trip demand from a source to a destination. The goal is to find a walk and delay for each demand so that no two trips occupy the same vertex at the same time, and so that a min… CONTINUE READING

#### Topics from this paper.

One Citation

#### References

##### Publications referenced by this paper.

SHOWING 1-10 OF 18 REFERENCES

Near-optimal hardness results and approximation algorithms for edge-disjoint paths and related problems

- Computer Science, Mathematics
- 2003

145

Routing with Minimum Wire Length in the Dogleg-Free Manhattan Model is NP-Complete

- Computer Science, Mathematics
- 1999

46

Algorithms for finding an optimal set of short disjoint paths in a communication network

- Computer Science
- 1992

33

A short proof of the NP-completeness of minimum sum interval coloring

- Mathematics, Computer Science
- 2005

29