Additional Results and Extensions for the paper "Probabilistic bounds on the k-Traveling Salesman Problem and the Traveling Repairman Problem”

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

This technical report provides additional results for the main paper “Probabilistic bounds on the k-Traveling Salesman Problem (k-TSP) and the Traveling Repairman Problem (TRP)”. For the k-TSP, we extend the probabilistic bounds derived in the main paper to the case of distributions with general densities. For the TRP, we propose a utility-based notion of fairness and derive constant-factor probabilistic bounds for this objective, thus extending the TRP bounds from the main paper to non-linear utilities.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
11/20/2022

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

The k-traveling salesman problem (k-TSP) seeks a tour of minimal length ...
research
05/15/2014

CDF-Intervals: A Reliable Framework to Reason about Data with Uncertainty

This research introduces a new constraint domain for reasoning about dat...
research
04/13/2021

A Refined Probabilistic Error Bound for Sums

This paper considers a probabilistic model for floating-point computatio...
research
04/11/2023

Bounds on non-linear errors for variance computation with stochastic rounding *

The main objective of this work is to investigate non-linear errors and ...
research
10/28/2017

Termination in Convex Sets of Distributions

Convex algebras, also called (semi)convex sets, are at the heart of mode...
research
02/09/2020

Edge-Isoperimetric Inequalities and Ball-Noise Stability: Linear Programming and Probabilistic Approaches

Let Q_n^r be the r-power of the hypercube {-1,1}^n. The discrete edge-is...
research
03/13/2013

Towards Precision of Probabilistic Bounds Propagation

The DUCK-calculus presented here is a recent approach to cope with proba...

Please sign up or login with your details

Forgot password? Click here to reset