Author of the publication

Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs.

, and . LION, volume 11968 of Lecture Notes in Computer Science, page 201-207. Springer, (2019)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space., and . LION, volume 11353 of Lecture Notes in Computer Science, page 402-410. Springer, (2018)On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs., , and . DOOR, volume 9869 of Lecture Notes in Computer Science, page 136-147. Springer, (2016)On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem., and . AIST, volume 11179 of Lecture Notes in Computer Science, page 283-293. Springer, (2018)On Asymptotically Optimal Solvability of Max m-k-Cycles Cover Problem in a Normed Space., and . MOTOR, volume 12095 of Lecture Notes in Computer Science, page 85-97. Springer, (2020)On Asymptotically Optimal Approach for the Problem of Finding Several Edge-Disjoint Spanning Trees of Given Diameter in an Undirected Graph with Random Edge Weights., , and . MOTOR, volume 12755 of Lecture Notes in Computer Science, page 67-78. Springer, (2021)Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem., and . AIST, volume 10716 of Lecture Notes in Computer Science, page 304-312. Springer, (2017)A Given Diameter MST on a Random Graph., , and . OPTIMA, volume 12422 of Lecture Notes in Computer Science, page 110-121. Springer, (2020)Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs., and . LION, volume 11968 of Lecture Notes in Computer Science, page 201-207. Springer, (2019)On Given Diameter MST Problem on Random Input Data., and . MOTOR (2), volume 1090 of Communications in Computer and Information Science, page 30-38. Springer, (2019)An Effective Algorithm for the Three-Stage Facility Location Problem on a Tree-Like Network., and . AIST (Supplement), volume 1357 of Communications in Computer and Information Science, page 267-274. Springer, (2020)