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 3, Pages 3–12 (Mi da32)  
This article is cited in 5 scientific papers (total in 5 papers)

Certain generalization of the maximum traveling salesman problem

A. E. Baburin, E. Kh. Gimadi

Sobolev Institute of Mathematics, Siberian Branch of the Russian Academy of Sciences
Full-text PDF (294 kB) Citations (5)
References:
PDF
HTML
Abstract: The problem is considered of finding in a complete undirected weighted graph a connected spanning subgraph with the given degrees of the vertices having maximum total weight of the edges. An approximate polynomial algorithm is presented for this problem. The algorithm is analyzed, and some upper bounds of its error are established in the general case as well as in the metric and Euclidean cases.
English version:
Journal of Applied and Industrial Mathematics, 2007, Volume 1, Issue 4, Pages 418–423
DOI: https://doi.org/10.1134/S1990478907040047
Bibliographic databases:
Language: Russian
Citation: A. E. Baburin, E. Kh. Gimadi, “Certain generalization of the maximum traveling salesman problem”, Diskretn. Anal. Issled. Oper., Ser. 1, 13:3 (2006), 3–12; J. Appl. Industr. Math., 1:4 (2007), 418–423
Citation in format AMSBIB
\Bibitem{BabGim06}
\by A.~E.~Baburin, E.~Kh.~Gimadi
\paper Certain generalization of the maximum traveling salesman problem
\jour Diskretn. Anal. Issled. Oper., Ser.~1
\yr 2006
\vol 13
\issue 3
\pages 3--12
\mathnet{http://mi.mathnet.ru/da32}
\mathscinet{http://mathscinet.ams.org/mathscinet-getitem?mr=2289368}
\zmath{https://zbmath.org/?q=an:1249.90297}
\transl
\jour J. Appl. Industr. Math.
\yr 2007
\vol 1
\issue 4
\pages 418--423
\crossref{https://doi.org/10.1134/S1990478907040047}
\scopus{https://www.scopus.com/record/display.url?origin=inward&eid=2-s2.0-37249087168}
Linking options:
  • https://www.mathnet.ru/eng/da32
  • https://www.mathnet.ru/eng/da/v13/s1/i3/p3
    • This publication is cited in the following 5 articles:
    Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    		Дискретный анализ и исследование операций
    Statistics & downloads:
    Abstract page:600
    Full-text PDF :201
    References:60
     
      Contact us:
    		  Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024