Diskretnyi Analiz i Issledovanie Operatsii
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive
Impact factor
Guidelines for authors

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS


Diskretn. Anal. Issled. Oper.:
Year:
Volume:
Issue:
Page:
Find




Personal entry:
Login:
Password:
Save password
Enter
Forgotten password?
Register

Diskretnyi Analiz i Issledovanie Operatsii, 2011, Volume 18, Issue 4, Pages 17–48 (Mi da658)  
This article is cited in 15 scientific papers (total in 15 papers)

Polynomial algorithm with approximation ratio $7/9$ for maximum 2-PSP

A. N. Glebovab, D. Zh. Zambalayevaa

a S. L. Sobolev Institute of Mathematics, SB RAS, Novosibirsk, Russia
b Novosibirsk State University, Novosibirsk, Russia
Full-text PDF (538 kB) Citations (15)
References:
PDF
HTML
Abstract: We study a 2-peripatetic salesman problem on maximum which consists in finding two edge-disjoint Hamiltonian cycles of maximum total weight in a complete undirected graph. We present a cubic time approximation algorithm for this problem with guaranteed ratio $7/9$, the best known for today. Ill. 5, bibliogr. 14.
Keywords: traveling salesman problem, 2-peripatetic salesman problem, polynomial algorithm, guaranteed approximation ratio.
Received: 25.01.2011
Revised: 06.05.2011
English version:
Journal of Applied and Industrial Mathematics, 2012, Volume 6, Issue 1, Pages 69–89
DOI: https://doi.org/10.1134/S1990478912010085
Bibliographic databases:
Document Type: Article
UDC: 519.8
Language: Russian
Citation: A. N. Glebov, D. Zh. Zambalayeva, “Polynomial algorithm with approximation ratio $7/9$ for maximum 2-PSP”, Diskretn. Anal. Issled. Oper., 18:4 (2011), 17–48; J. Appl. Industr. Math., 6:1 (2012), 69–89
Citation in format AMSBIB
\Bibitem{GleZam11}
\by A.~N.~Glebov, D.~Zh.~Zambalayeva
\paper Polynomial algorithm with approximation ratio $7/9$ for maximum 2-PSP
\jour Diskretn. Anal. Issled. Oper.
\yr 2011
\vol 18
\issue 4
\pages 17--48
\mathnet{http://mi.mathnet.ru/da658}
\mathscinet{https://mathscinet.ams.org/mathscinet-getitem?mr=2894339}
\zmath{https://zbmath.org/?q=an:1249.90300}
\transl
\jour J. Appl. Industr. Math.
\yr 2012
\vol 6
\issue 1
\pages 69--89
\crossref{https://doi.org/10.1134/S1990478912010085}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-84857682297}
Linking options:
  • https://www.mathnet.ru/eng/da658
  • https://www.mathnet.ru/eng/da/v18/i4/p17
    • This publication is cited in the following 15 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2025