Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles
DOI10.1134/S0081543816090078zbMath1375.90255OpenAlexW2582648747MaRDI QIDQ2396372
Publication date: 8 June 2017
Published in: Proceedings of the Steklov Institute of Mathematics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1134/s0081543816090078
computational complexityprobabilistic analysistraveling salesman problemapproximation algorithmsasymptotic optimalityrandom instancesapproximation accuracycycle cover of a graph
Approximation methods and heuristics in mathematical programming (90C59) Combinatorial optimization (90C27)
Related Items (1)
Cites Work
This page was built for publication: Asymptotically optimal approach to the approximate solution of several problems of covering a graph by nonadjacent cycles