Sciact
  • EN
  • RU

Probabilistic analysis of an approximation algorithm for the m-peripatetic salesman problem on random instances unbounded from above Full article

Journal Proceedings of the Steklov Institute of Mathematics
ISSN: 0081-5438 , E-ISSN: 1531-8605
Output data Year: 2015, Volume: 289, Number: S1, Pages: 77-87 Pages count : 11 DOI: 10.1134/s0081543815050077
Tags approximation algorithm; asymptotic optimality; density function; exponential distribution; m-peripatetic salesman problem; random instances; time complexity; truncated normal distribution
Authors Gimadi E.Kh. 1,2 , Istomin A.M. 1 , Rykov I.A. 1 , Tsidulko O.Yu. 1
Affiliations
1 Sobolev Institute of Mathematics
2 Novosibirsk State University
Cite: Gimadi E.K. , Istomin A.M. , Rykov I.A. , Tsidulko O.Y.
Probabilistic analysis of an approximation algorithm for the m-peripatetic salesman problem on random instances unbounded from above
Proceedings of the Steklov Institute of Mathematics. 2015. V.289. NS1. P.77-87. DOI: 10.1134/s0081543815050077 WOS Scopus OpenAlex
Original: Гимади Э.Х. , Истомин А.М. , Рыков И.А. , Цидулко О.Ю.
Вероятностный анализ приближенного алгоритма для решения задачи о нескольких коммивояжерах на случайных входных данных, неограниченных сверху
Труды Института математики и механики УрО РАН (Trudy Instituta Matematiki i Mekhaniki UrO RAN). 2014. Т.20. №2. С.88-98. WOS РИНЦ
Identifiers:
Web of science: WOS:000356931500007
Scopus: 2-s2.0-84932616544
OpenAlex: W2473151934
Citing:
DB Citing
Scopus 2
Web of science 1
OpenAlex 2
Altmetrics: