Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph

Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph Full article

Journal

Discrete Applied Mathematics
ISSN: 0166-218X

Output data

Year: 2015, Volume: 196, Pages: 54-61 Pages count : 8 DOI: 10.1016/j.dam.2015.03.007

Tags

Asymmetric m-Peripatetic Salesman Problem; Asymptotic optimality; Disjoint Hamiltonian circuits; Performance guarantees; Polynomial algorithm; Random inputs

Authors

Gimadi E.Kh. ^1,2 , Glebov A.N. ^1,2 , Skretneva A. A. ^1,2 , Tsidulko O.Yu. ^1,2 , Zambalaeva D. Zh. ^1,2

Affiliations

1	Sobolev Institute of Mathematics
2	Novosibirsk State University

Gimadi E.K. , Glebov A.N. , Skretneva A.A. , Tsidulko O.Y. , Zambalaeva D.Z.
Combinatorial algorithms with performance guarantees for finding several Hamiltonian circuits in a complete directed weighted graph
Discrete Applied Mathematics. 2015. V.196. P.54-61. DOI: 10.1016/j.dam.2015.03.007 WOS Scopus OpenAlex

Web of science:	WOS:000362605700005
Scopus:	2-s2.0-84954379110
OpenAlex:	W2037601619

DB	Citing
Web of science	2
Scopus	3
OpenAlex	3