Fast Algorithm to Find 2-Factor of Minimum Weight-Reference-Cited by-同舟云学术

Fast Algorithm to Find 2-Factor of Minimum Weight

Published:2016-05 Issue:3 Volume:52 Page:467-474
ISSN:1060-0396
Container-title:Cybernetics and Systems Analysis
language:en
Short-container-title:Cybern Syst Anal

Author:

Matsiy O. B.,Morozov A. V.,Panishev A. V.

Publisher

Springer Science and Business Media LLC

Subject

General Computer Science

Link

http://link.springer.com/content/pdf/10.1007/s10559-016-9847-9.pdf

Reference6 articles.

1. H. N. Gabow, “A good algorithm for smallest spanning trees with a degree constraint,” Networks, 8, No. 3, 201–208 (1978).

2. L. Lovasz and M. D. Plummer, Matching Theory, North Holland, Budapest (1986).

3. H. Papadimitriou and K. Steiglitz, Combinatorial Optimization: Algorithms and Complexity, Dover Publ. (1998).

4. S. I. Sergeev, “The symmetric traveling salesman problem. II. New low bounds,” Autom. and Remote Control, 71, No. 4, 681–696 (2010).

5. A. Yu. Levchenko, A. V. Morozov, and A. V. Panishev, “Fast algorithm to solve the assignment problem for finding the lower bound of route cost in traveling salesman problem,” Iskusstv. Intellekt, Issue 4, 406–416 (2011).

Cited by 3 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Approaches to Solving Basic Problems of Closed Routes;2020 IEEE 15th International Conference on Advanced Trends in Radioelectronics, Telecommunications and Computer Engineering (TCSET);2020-02

2. Constructing an algorithm of quadratic time complexity for finding the maximal matching;Eastern-European Journal of Enterprise Technologies;2019-12-18

3. A Recurrent Algorithm to Solve the Weighted Matching Problem;Cybernetics and Systems Analysis;2016-09