Abstract
Simple heuristics for (combinatorial) optimization problems often show a remarkable performance in practice. Worstcase analysis often falls short of explaining this performance. Because of this, "beyond worstcase analysis" of algorithms has recently gained a lot of attention, including probabilistic analysis of algorithms.
The instances of many (combinatorial) optimization problems are essentially a discrete metric space. Probabilistic analysis for such metric optimization problems has nevertheless mostly been conducted on instances drawn from Euclidean space, which provides a structure that is usually heavily exploited in the analysis. However, most instances from practice are not Euclidean. Little work has been done on metric instances drawn from other, more realistic, distributions. Some initial results have been obtained in recent years, where random shortest path metrics generated from dense graphs (either complete graphs or Erdős  Rényi random graphs) have been used so far.
In this paper we extend these findings to sparse graphs, with a focus on grid graphs. A random shortest path metric is constructed by drawing independent random edge weights for each edge in the graph and setting the distance between every pair of vertices to the length of a shortest path between them with respect to the drawn weights. For such instances generated from a grid graph, we prove that the greedy heuristic for the minimum distance maximum matching problem, and the nearest neighbor and insertion heuristics for the traveling salesman problem all achieve a constant expected approximation ratio. Additionally, for instances generated from an arbitrary sparse graph, we show that the 2opt heuristic for the traveling salesman problem also achieves a constant expected approximation ratio.
BibTeX  Entry
@InProceedings{klootwijk_et_al:LIPIcs:2020:12049,
author = {Stefan Klootwijk and Bodo Manthey},
title = {{Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics}},
booktitle = {31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020)},
pages = {19:119:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {9783959771474},
ISSN = {18688969},
year = {2020},
volume = {159},
editor = {Michael Drmota and Clemens Heuberger},
publisher = {Schloss DagstuhlLeibnizZentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2020/12049},
URN = {urn:nbn:de:0030drops120494},
doi = {10.4230/LIPIcs.AofA.2020.19},
annote = {Keywords: Random shortest paths, Random metrics, Approximation algorithms, Firstpassage percolation}
}
Keywords: 

Random shortest paths, Random metrics, Approximation algorithms, Firstpassage percolation 
Collection: 

31st International Conference on Probabilistic, Combinatorial and Asymptotic Methods for the Analysis of Algorithms (AofA 2020) 
Issue Date: 

2020 
Date of publication: 

10.06.2020 