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, Ser. 1, 2006, Volume 13, Issue 2, Pages 11–20 (Mi da28)  
This article is cited in 23 scientific papers (total in 23 papers)

A polynomial algorithm with an accuracy estimate of 3/4 for finding two nonintersecting Hamiltonian cycles of maximum weight

A. A. Ageev, A. E. Baburin, E. Kh. Gimadi

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (240 kB) Citations (23)
References:
PDF
HTML
Abstract: We study the problem in which, given a complete undirected edge-weighted graph, it is required to find two (edge) disjoint Hamiltonian cycles of maximum total weight. The problem is known to be NP-hard in the strong sense. We present a 3/4-approximation algorithm with the running time $O(n^3)$.
English version:
Journal of Applied and Industrial Mathematics, 2007, Volume 1, Issue 2, Pages 142–147
DOI: https://doi.org/10.1134/S1990478907020020
Bibliographic databases:
Language: Russian
Citation: A. A. Ageev, A. E. Baburin, E. Kh. Gimadi, “A polynomial algorithm with an accuracy estimate of 3/4 for finding two nonintersecting Hamiltonian cycles of maximum weight”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:2 (2006), 11–20; J. Appl. Industr. Math., 1:2 (2007), 142–147
Citation in format AMSBIB
\Bibitem{AgeBabGim06}
\by A.~A.~Ageev, A.~E.~Baburin, E.~Kh.~Gimadi
\paper A polynomial algorithm with an accuracy estimate of~3/4 for finding two nonintersecting Hamiltonian cycles of maximum weight
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2006
\vol 13
\issue 2
\pages 11--20
\mathnet{http://mi.mathnet.ru/da28}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2289335}
\zmath{https://zbmath.org/?q=an:1249.05232}
\transl
\jour J. Appl. Industr. Math.
\yr 2007
\vol 1
\issue 2
\pages 142--147
\crossref{https://doi.org/10.1134/S1990478907020020}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-34447100592}
Linking options:
  • https://www.mathnet.ru/eng/da28
  • https://www.mathnet.ru/eng/da/v13/s1/i2/p11
    • This publication is cited in the following 23 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:675
    Full-text PDF :190
    References:60
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024