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. 2, 2004, Volume 11, Issue 1, Pages 11–25 (Mi da125)  
This article is cited in 14 scientific papers (total in 14 papers)

Approximate algorithms for finding two edge-disjoint Hamiltonian cycles of minimal weight

A. E. Baburin, E. Kh. Gimadi, N. M. Korkishko

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (342 kB) Citations (14)
References:
PDF
HTML
Received: 10.10.2003
Bibliographic databases:
UDC: 519.8
Language: Russian
Citation: A. E. Baburin, E. Kh. Gimadi, N. M. Korkishko, “Approximate algorithms for finding two edge-disjoint Hamiltonian cycles of minimal weight”, Diskretn. Anal. Issled. Oper., Ser. 2, 11:1 (2004), 11–25
Citation in format AMSBIB
\Bibitem{BabGimKor04}
\by A.~E.~Baburin, E.~Kh.~Gimadi, N.~M.~Korkishko
\paper Approximate algorithms for finding two edge-disjoint Hamiltonian cycles of minimal weight
\jour Diskretn. Anal. Issled. Oper., Ser.~2
\yr 2004
\vol 11
\issue 1
\pages 11--25
\mathnet{http://mi.mathnet.ru/da125}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2084543}
\zmath{https://zbmath.org/?q=an:1045.05082}
Linking options:
  • https://www.mathnet.ru/eng/da125
  • https://www.mathnet.ru/eng/da/v11/s2/i1/p11
    • This publication is cited in the following 14 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:685
    Full-text PDF :196
    References:72
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024