DeepAI AI Chat
Log In Sign Up

On the Approximability of Time Disjoint Walks

by   Alexandre Bayen, et al.
cornell university
berkeley college

We introduce the combinatorial optimization problem Time Disjoint Walks. 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 path and delay for each demand so that no two trips occupy the same vertex at the same time, and so that the sum of trip times is minimized. We show that even for DAGs with max degree Δ≤3, Time Disjoint Walks is APX-hard. We also present a natural approximation algorithm, and provide a tight analysis. In particular, we prove that it achieves an approximation ratio of Θ(k/ k) on bounded-degree DAGs, and Θ(k) on DAGs and bounded-degree digraphs.


page 1

page 2

page 3

page 4


Approximating TSP walks in subcubic graphs

We prove that every simple 2-connected subcubic graph on n vertices with...

The Pendulum Arrangement: Maximizing the Escape Time of Heterogeneous Random Walks

We identify a fundamental phenomenon of heterogeneous one dimensional ra...

Menger's Theorem for Temporal Paths (Not Walks)

A temporal graph is a graph whose edges are available only at specific t...

Interference-free Walks in Time: Temporally Disjoint Paths

We investigate the computational complexity of finding temporally disjoi...

Improved Approximation for Node-Disjoint Paths in Grids with Sources on the Boundary

We study the classical Node-Disjoint Paths (NDP) problem: given an undir...

Combinatorial Algorithms for Edge-Disjoint T-Paths and Integer Free Multiflow

Let G=(V,E) be a multigraph with a set T⊆ V of terminals. A path in G is...

A constant FPT approximation algorithm for hard-capacitated k-means

Hard-capacitated k-means (HCKM) is one of the fundamental problems remai...