Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem Full article

Conference	6th International Conference on Analysis of Images, Social Networks and Texts 27-29 Jul 2017 , Москва
Journal	Lecture Notes in Computer Science ISSN: 0302-9743 , E-ISSN: 1611-3349
Output data	Year: 2018, Number: 10716, Pages: 304-312 Pages count : 9 DOI: 10.1007/978-3-319-73013-4_28
Tags	Edge-disjoint Hamiltonian cycles; Maximum m-Peripatetic salesman problem; Time complexity
Authors	Gimadi Edward Kh. 1,2 , Tsidulko Oxana Yu. 1,2
Affiliations	1 Sobolev Institute of Mathematics 2 Novosibirsk State University