Probabilistic bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem

11/20/2022
by   Moise Blanchard, et al.
0

The k-traveling salesman problem (k-TSP) seeks a tour of minimal length that visits a subset of k≤ n points. The traveling repairman problem (TRP) seeks a complete tour with minimal latency. This paper provides constant-factor probabilistic approximations of both problems. We first show that the optimal length of the k-TSP path grows at a rate of Θ(k/n^1/2(1+1/k-1)). The proof provides a constant-factor approximation scheme, which solves a TSP in a high-concentration zone – leveraging large deviations of local concentrations. Then, we show that the optimal TRP latency grows at a rate of Θ(n√(n)). This result extends the classical Beardwood-Halton-Hammersley theorem to the TRP. Again, the proof provides a constant-factor approximation scheme, which visits zones by decreasing order of probability density. We discuss practical implications of this result in the design of transportation and logistics systems. Finally, we propose dedicated notions of fairness – randomized population-based fairness for the k-TSP and geographical fairness for the TRP – and give algorithms to balance efficiency and fairness.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
01/11/2023

Proportional Fairness in Obnoxious Facility Location

We consider the obnoxious facility location problem (in which agents pre...
research
01/18/2022

Improved Approximation and Scalability for Fair Max-Min Diversification

Given an n-point metric space (𝒳,d) where each point belongs to one of m...
research
08/30/2023

A constant factor approximation for the (p,3)-flexible graph connectivity problem

In this article we provide a constant factor approximation for the (p,3)...
research
12/24/2019

Stochastic Fairness and Language-Theoretic Fairness in Planning on Nondeterministic Domains

We address two central notions of fairness in the literature of planning...
research
10/07/2020

Fairness in Influence Maximization through Randomization

The influence maximization paradigm has been used by researchers in vari...

Please sign up or login with your details

Forgot password? Click here to reset