We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highway dimension. This graph parameter roughly measures how many central nodes are visited by all shortest paths of a certain length. It has been shown that transportation networks, on which TSP and STP naturally occur for various applications in logistics, typically have a small highway dimension. While it was previously shown that these problems admit a quasi-polynomial time approximation scheme on graphs of constant highway dimension, we demonstrate that a significant improvement is possible in the special case when the highway dimension is 1. Specifically, we present a fully-polynomial time approximation scheme (FPTAS). We also prove that both...
The Steiner Traveling Salesman Problem (STSP) is a variant of the TSP that is particularly suitable ...
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which...
We present an implementation of a linear-time approximation scheme for the traveling salesman proble...
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highwa...
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highwa...
The graph parameters highway dimension and skeleton dimension were introduced to capture the propert...
The concept of bounded highway dimension was developed to capture observed properties of road networ...
We study clustering problems such as k-Median, k-Means, and Facility Location in graphs of low highw...
Abstract. We present an approach for the traveling salesman problem with graph metric based on Stein...
<p> The Steiner travelling salesman problem (STSP) is an important issue in intelligent transportat...
We study a problem that models safely routing a convoy through a transportation network, where any v...
We explore the relationship between VC-dimension and graph algorithm design. In particular, we show ...
International audience; In TSP with profits we have to find an optimal tour and a set of customers s...
We study clustering problems such as k-Median, k-Means, and Facility Location in graphs of low highw...
We present a randomized approximation algorithm for computing traveling salesperson tours in undirec...
The Steiner Traveling Salesman Problem (STSP) is a variant of the TSP that is particularly suitable ...
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which...
We present an implementation of a linear-time approximation scheme for the traveling salesman proble...
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highwa...
We study the Travelling Salesperson (TSP) and the Steiner Tree problem (STP) in graphs of low highwa...
The graph parameters highway dimension and skeleton dimension were introduced to capture the propert...
The concept of bounded highway dimension was developed to capture observed properties of road networ...
We study clustering problems such as k-Median, k-Means, and Facility Location in graphs of low highw...
Abstract. We present an approach for the traveling salesman problem with graph metric based on Stein...
<p> The Steiner travelling salesman problem (STSP) is an important issue in intelligent transportat...
We study a problem that models safely routing a convoy through a transportation network, where any v...
We explore the relationship between VC-dimension and graph algorithm design. In particular, we show ...
International audience; In TSP with profits we have to find an optimal tour and a set of customers s...
We study clustering problems such as k-Median, k-Means, and Facility Location in graphs of low highw...
We present a randomized approximation algorithm for computing traveling salesperson tours in undirec...
The Steiner Traveling Salesman Problem (STSP) is a variant of the TSP that is particularly suitable ...
We present a polynomial-time 9/7-approximation algorithm for the graphic TSP for cubic graphs, which...
We present an implementation of a linear-time approximation scheme for the traveling salesman proble...