?
The Mixed Chinese Postman Problem
Proceedings of the Institute for System Programming of the RAS. 2017. Vol. 29. No. 4. P. 107–122.
The routing problems are important for logistic and transport sphere. Basically, the routing problems related to determining the optimal set of routes in the multigraph. The Chinese postman problem (CPP) is a special case of the routing problem, which has many potential applications. We propose to solve the MCPP (special NP-hard case of CPP, which defined on mixed multigraph) using the reduction of the original problem into General Travelling Salesman Problem (GTSP). The variants of CPP are pointed out. The mathematical formulations of some problems are presented. The algorithm for reduction the MCPP in multigraph into GTSP is shown. The experimental results of solving MCPP in multigraph through the reduction into GTSP are presented.
Priority areas:
IT and mathematics
Language:
English
Абызов А. Н., Буутай П. Н., Математика и теоретические компьютерные науки 2026 Т. 4 № 2 С. 4–75
This paper is expository and methodological in nature and is devoted to the development of E.I. Zolotarev’s ideas embedded in his approach to the proof of the quadratic reciprocity law (1872). We consider extensions of Zolotarev’s approach to abstract number rings presented in the work of A. Brunyate and P.L. Clark (2015), and to finite ...
Added: July 30, 2026
Ponomarenko A., / Series Computer Science "arxiv.org". 2025.
This paper addresses the challenge of merging hierarchical navigable small world (HNSW) graphs, a critical operation for distributed systems, incremental indexing, and database compaction. We propose three algorithms for this task: Naive Graph Merge (NGM), Intra Graph Traversal Merge (IGTM), and Cross Graph Traversal Merge (CGTM). These algorithms differ in their approach to vertex selection ...
Added: July 30, 2026
Уилкокс П., Romanov A., М.: ДМК Пресс, 2025.
Книга, которую вы держите в руках, продолжает серию «Книжная полка истового
инженера», которая издается при поддержке компании YADRO.
Данная книга представляет собой учебник по теоретическим основам продвинутой
функциональной верификации и содержит лучшие практики, используемые в настоящее
время. В ней подробно описана унифицированная методология верификации
(UVM) и раскрыты такие темы, как функциональный виртуальный прототип, функциональное
покрытие, утверждения, формальная верификация, тестбенчи, косимуляция,
эмуляция, аппаратное ...
Added: July 30, 2026
Mikhaylets E. V., Razorenova A. М., Chernyshev V. L. et al., Scientific Reports 2026 Vol. 16 Article 23560
Meditation offers a naturalistic paradigm for studying introspection, yet the neural dynamics of advanced tantric practices remain largely unexplored. Buddhist Highest Yoga Tantra (BHYT) comprises a sequence of eight dissolution stages culminating in the “clear light” state. We recorded EEG during eyes-closed BHYT meditation performed in monasteries and hermitages (51 sessions from 36 male practitioners; ...
Added: July 29, 2026
Попеленский Ф. Ю., Математический сборник 2026 Т. 217 № 2 С. 108–153
In a recent paper Buchstaber and the author introduced a new structure on the cohomology of Hopf algebras in terms of the Buchstaber spectral sequence (Bss). We fully calculate this structure on the cohomology (known for a long time) of the important Hopf subalgebra A(1) of the classical Steenrod algebra A2.
As part of a demonstration ...
Added: July 28, 2026
Metlov K., Andrei B. Bogatyrëv, Annalen der Physik 2026 Vol. 538 No. 6 Article e70234
Thanks to the recent progress in bulk full three-dimensional nanoscale magnetization distribution imaging, there is a growing
interest to three-dimensional (3D) magnetization textures, promising new high information density spintronic applications.
Compared to 1D domain walls or 2D magnetic vortices/skyrmions, they are a much harder challenge to represent, analyze and
reason about. Here we build analytical representation for such ...
Added: July 28, 2026
Думкин Н. А., Alexandrov D., Прозорский М. А., Труды Института системного программирования РАН 2026 Т. 38 № 1 С. 255–274
A theoretically sound approach to adaptive client-side video fragment restoration is proposed using
machine learning and scene analysis methods. The method includes a formal problem statement, a finite-state
machine model for decision making, a restoration cost function, and a new stage in video preparation: scene
dynamics assessment followed by recording a feature in an HLS playlist. This feature ...
Added: July 27, 2026
Menovshchikov A., Ukhlov A., Rendiconti del Circolo Matematico di Palermo 2026 Vol. 75 Article 91
We consider the nonlinear Neumann eigenvalue problem in outward cuspidal domains with a weighted measure. Using composition operators on Sobolev spaces, we establish embeddings of Sobolev spaces into weighted Lebesgue spaces. These embeddings give the solvability of the Neumann spectral problem in this setting and provide estimates for the corresponding weighted Neumann eigenvalues. ...
Added: July 27, 2026
Menovshchikov A., Journal of Mathematical Sciences 2026 Vol. 298 P. 608–618
We study the set of (p, q)-eigenvalues of the p-Laplace operator with no-flux boundary conditions. We show that this set is closed and that its smallest positive element (the first nontrivial eigenvalue) admits a variational characterization. Moreover, we establish lower bounds for this eigenvalue in cuspidal domains. ...
Added: July 27, 2026
Cham: Springer, 2026.
This open access set, LNAI 16688-16689, constitutes the proceedings of the 13th International Joint Conference, IJCAR 2026, held in Lisbon, Portugal, during July 26–29, 2026.
The 41 full research papers and 8 short papers included in these two volumes were carefully reviewed and selected from 112 submissions. The papers cover the following topical sections:
Part I: Theorem ...
Added: July 26, 2026
Edward R. Rzaev, Aleksandr Y. Romanov, Andrey M. Sukhov, IEEE Access 2026 Vol. 14 P. 2169–3536
This work presents a hierarchy of strictly local fault-tolerant routing algorithms for 3D mesh networks-on-chip, culminating in an algorithm that combines a live-neighbor selection rule with a bounded single-hop rollback mechanism. The proposed algorithms operate exclusively on immediate neighbor information, maintain O(1) per hop complexity, and require no global topology knowledge, additional virtual channels, or ...
Added: July 23, 2026
Pislyakov V., Вестник Томского государственного университета. Филология 2026 № 101 С. 175–192
This article examines the use of proverbs in academic texts—specifically, articles published in Russian research journals. For the experiment, ten proverbs were selected as the intersection of two fundamentally different paremiological surveys aimed at compiling lists of popular or common Russian proverbs. One of these surveys was conducted by the classic of paremiology, G.L. Permyakov, ...
Added: July 22, 2026
Association for Computing Machinery (ACM), 2026.
Wominjeka, and welcome to the 49th International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR 2026), held in Melbourne | Naarm, Australia, from 20–24 July 2026. SIGIR 2026 takes place on the unceded lands of the Woi Wurrung and Boon Wurrung language groups of the eastern Kulin nation, and we pay our ...
Added: July 22, 2026
Korogod D., Shapeev A., Ivan S. Novikov, Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 114 No. 2 Article 024104
We present two models with explicit long-range electrostatics in the form of Coulomb interactions. Both models include point charges depending on their local atomic environments, and the second model also conserves a total charge of an atomic system. We combine the proposed long-range models with the local moment tensor potential (MTP) and demonstrate that they ...
Added: July 22, 2026
Sozykin K., Rybin N., Chertkov A. et al., Physical Review B: Condensed Matter and Materials Physics 2026 Vol. 113 No. 22 Article 224111
The global optimization of atomic clusters represents a fundamental challenge in computational chemistry and materials science due to the exponential growth of local minima with system size (i.e., the curse of dimensionality). We introduce a framework that overcomes this limitation by exploiting the low-rank structure of potential energy surfaces through tensor train (TT) decomposition. Our ...
Added: July 22, 2026
Singapore: Springer, 2024.
Included in the following conference series:
INdAM: INdAM Meeting: Kolmogorov Operators and their Applications Workshop
Conference proceedings info: INdAM 2022
Kolmogorov equations are a fundamental bridge between the theory of partial differential equations and that of stochastic differential equations that arise in several research fields.
This volume collects a selection of the talks given at the Cortona meeting by ...
Added: July 17, 2026
Veretennikov A., Pascucci A., Rondelli A., Stochastic Processes and their Applications 2026 Vol. 199 Article 104978
We present existence results for weak solutions to a broad class of degenerate McKean-Vlasov equations with rough coefficients, expanding upon and refining the techniques recently introduced by the third author. Under certain structural conditions, we also establish results concerning both weak and strong well-posedness. ...
Added: July 17, 2026
Veretennikov A., Ляппиева А. А., Теория вероятностей и ее применения 2026 Т. 71 № 2 С. 295–304
Установлен новый результат о сильной единственности для многомерного СДУ с невырожденной диффузией и частично нерегулярным сносом. Его можно рассматривать как комбинированный вариант на темы Ямада и Ватанабэ (1971), Звонкина (1974) и первого автора настоящей статьи (1980). ...
Added: July 17, 2026
Piontkovski D., / Series arXiv "math". 2026.
A noncommutative projective variety is defined, following Artin and Zhang, by a graded coherent algebra 𝐴. The category of coherent sheaves is then the quotient qgr(𝐴) of the category of finitely presented graded modules by the subcategory of torsion modules. We consider the categorical and polynomial entropies of the Serre twist, that is, of the ...
Added: June 23, 2026
Piontkovski D., / Series arXiv "math". 2025.
If a symmetric multilinear algebra is weakly nil, then it is Engel. This result may be regarded as an infinite-dimensional analogue of the well-known Jacobian theorem, which states that if a polynomial mapping has a polynomial inverse, then its Jacobian matrix is invertible. This refines a theorem of Gerstenhaber and partially answers a question posed ...
Added: June 23, 2026
Shipilov F., Barnyakov A., Ivanov A. et al., / Series Physics "arxiv.org". 2026.
A fast simulation of the detector response is a vital task in high-energy physics (HEP). Traditional Monte-Carlo methods form the backbone of modern particle physics simulation software but are computationally expensive. We present a machine-learning-based approach to fast simulation of the Focusing Aerogel Ring Imaging Cherenkov (FARICH) detector response. Given a particle track and momentum, ...
Added: May 19, 2026
Derkacheva A., Sakirkina M., Kraev G. et al., /. 2026.
Comprehensive data on natural hazards and their consequences are crucial for effective for risk assessment, adaptation planning, and emergency response. However, many countries face challenges with fragmented, inconsistent, and inaccessible data, particularly regarding local-scale events. To address this data gap in Russia, we developed an end-to-end processing pipeline that scrapes news from various online sources, ...
Added: April 28, 2026
Pilé I., Deng Y., Shchur L., / Series arXiv "math". 2026. No. 2604.10254.
We investigate the spatial overlap of successive spin configurations in Markov chain Monte Carlo simulations using the local Metropolis algorithm and the Svendsen-Wang and Wolff cluster algorithms. We examine the dynamics of these algorithms for two models in different universality classes: the Ising model and the Potts model with three components. The overlap of two ...
Added: April 20, 2026
Gabdullin N., Androsov I., / Series Computer Science "arxiv.org". 2026.
Label prediction in neural networks (NNs) has O(n) complexity proportional to the number of classes. This holds true for classification using fully connected layers and cosine similarity with some set of class prototypes. In this paper we show that if NN latent space (LS) geometry is known and possesses specific properties, label prediction complexity can ...
Added: April 2, 2026