Chelyabinskiy Fiziko-Matematicheskiy Zhurnal
RUS  ENG    JOURNALS   PEOPLE   ORGANISATIONS   CONFERENCES   SEMINARS   VIDEO LIBRARY   PACKAGE AMSBIB  
General information
Latest issue
Archive

Search papers
Search references

RSS
Latest issue
Current issues
Archive issues
What is RSS



Chelyab. Fiz.-Mat. Zh.:
Year:
Volume:
Issue:
Page:
Find






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


Chelyabinskiy Fiziko-Matematicheskiy Zhurnal, 2016, Volume 1, Issue 1, Pages 16–23 (Mi chfmj2)  

Mathematics

On optimal marking algorithms

M. N. Alekseeva, F. M. Alekseevb

a Chelyabinsk State University, Chelyabinsk, Russia
b Moscow Institute of Physics and Technology, Dolgoprudnyj, Russia
References:
Abstract: The problem of choosing of the marking optimal order is considered as a special case of the traveling salesman problem. The algorithms for exact and approximate solutions search for the problem are proposed. The estimates of the algorithms complexity and possible approaches to their improvement are discussed.
Keywords: the traveling salesman problem, undirected weighted graph, minimum spanning tree, Hamiltonian path, dynamic programming, greedy algorithm, Prim’s algorithm, Kruskal’s algorithm.
Received: 18.02.2015
Revised: 02.02.2016
Bibliographic databases:
Document Type: Article
UDC: 519.17
Language: Russian
Citation: M. N. Alekseev, F. M. Alekseev, “On optimal marking algorithms”, Chelyab. Fiz.-Mat. Zh., 1:1 (2016), 16–23
Citation in format AMSBIB
\Bibitem{AleAle16}
\by M.~N.~Alekseev, F.~M.~Alekseev
\paper On optimal marking algorithms
\jour Chelyab. Fiz.-Mat. Zh.
\yr 2016
\vol 1
\issue 1
\pages 16--23
\mathnet{http://mi.mathnet.ru/chfmj2}
\elib{https://elibrary.ru/item.asp?id=27541602}
Linking options:
  • https://www.mathnet.ru/eng/chfmj2
  • https://www.mathnet.ru/eng/chfmj/v1/i1/p16
  • Citing articles in Google Scholar: Russian citations, English citations
    Related articles in Google Scholar: Russian articles, English articles
    Chelyabinskiy Fiziko-Matematicheskiy Zhurnal
    Statistics & downloads:
    Abstract page:134
    Full-text PDF :52
    References:21
     
      Contact us:
     Terms of Use  Registration to the website  Logotypes © Steklov Mathematical Institute RAS, 2024