Probabilistic Analysis of Optimization Problems on Sparse Random Shortest Path Metrics

Author:

Klootwijk Stefan,Manthey BodoORCID

Abstract

AbstractSimple heuristics for (combinatorial) optimization problems often show a remarkable performance in practice. Worst-case analysis often falls short of explaining this performance. Because of this, “beyond worst-case 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 sparse graphs with ‘fast growing cut sizes’, i.e. graphs for which $$|\delta (U)|=\Omega (|U|^\varepsilon )$$ | δ ( U ) | = Ω ( | U | ε ) for some constant $$\varepsilon \in (0,1)$$ ε ( 0 , 1 ) for all subsets U of the vertices, where $$\delta (U)$$ δ ( U ) is the set of edges connecting U to the remaining vertices. 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 sparse graph with fast growing cut sizes, 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 2-opt heuristic for the traveling salesman problem also achieves a constant expected approximation ratio.

Funder

Nederlandse Organisatie voor Wetenschappelijk Onderzoek

Publisher

Springer Science and Business Media LLC

Subject

Applied Mathematics,Computer Science Applications,General Computer Science

Reference30 articles.

1. Auffinger, A., Damron, M., Hanson, J.: 50 years of first passage percolation. In: arXiv e-prints, arXiv:1511.03262 [math.PR] (2015)

2. Aven, T.: Upper (lower) bounds on the mean of the maximum (minimum) of a number of random variables. J. Appl. Probab. 22(3), 723–728 (1985). https://doi.org/10.2307/3213876

3. Avis, D., Davis, B., Steele, J.M.: Probabilistic analysis of a Greedy Heuristic for Euclidean matching. Probab. Eng. Inf. Sci. 2(2), 143–156 (1988). https://doi.org/10.1017/S0269964800000711

4. Bafna, V., Kalyanasundaram, B., Pruhs, K.: Not all insertion methods yields constant approximate tours in the Euclidean plane. Theor. Comput. Sci. 125(2), 345–353 (1994). https://doi.org/10.1016/0304-3975(94)90257-7

5. Bentley, J. L., Saxe, J.B.: An analysis of two Heuristics for the Euclidean traveling salesman problem. In: Proceedings of the Eighteenth Annual Allerton Conference on Communication, Control, and Computing, October 8–10, 1980. Allerton House, Monticello, Illinois (1980) pp. 41–49

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3