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}
}
  • A. Bayen, J. Goodman, Eugene Vinitsky
  • Published 2020
  • Computer Science, Mathematics
  • Journal of Combinatorial Optimization
  • 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
    On the Approximability of Time Disjoint Walks
    1

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 18 REFERENCES