Edward Kh. Gimadi

11 papers Misc 3Unranked 8
YearRankTypeTitle / Venue / Authors
2024 Misc conf
An Asymptotically Optimal Algorithm for the Minimum Weight Spanning Tree with Arbitrarily Bounded Diameter on Random Inputs.
AIST
Edward Kh. Gimadi, Oxana Yu. Tsidulko
2021 — conf
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.
MOTOR
Edward Kh. Gimadi, Aleksandr S. Shevyakov, Alexandr A. Shtepa
2020 — conf
A Given Diameter MST on a Random Graph.
OPTIMA
Edward Kh. Gimadi, Aleksandr S. Shevyakov, Alexandr A. Shtepa
2020 — conf
An Effective Algorithm for the Three-Stage Facility Location Problem on a Tree-Like Network.
AIST (Supplement)
Edward Kh. Gimadi, Aleksandr S. Shevyakov
2020 — conf
On Asymptotically Optimal Solvability of Max m-k-Cycles Cover Problem in a Normed Space.
MOTOR
Edward Kh. Gimadi, Ivan A. Rykov
2019 — conf
Asymptotically Optimal Algorithms for the Prize-Collecting Traveling Salesman Problem on Random Inputs.
LION
Edward Kh. Gimadi, Oxana Yu. Tsidulko
2019 — conf
On Given Diameter MST Problem on Random Input Data.
MOTOR (2)
Edward Kh. Gimadi, Ekaterina Yu. Shin
2018 — conf
Asymptotically Optimal Algorithm for the Maximum m-Peripatetic Salesman Problem in a Normed Space.
LION
Edward Kh. Gimadi, O. Yu. Tsidulko
2018 Misc conf
On Modification of an Asymptotically Optimal Algorithm for the Maximum Euclidean Traveling Salesman Problem.
AIST
Edward Kh. Gimadi, Oxana Yu. Tsidulko
2017 Misc conf
Approximation Algorithms for the Maximum m-Peripatetic Salesman Problem.
AIST
Edward Kh. Gimadi, Oxana Yu. Tsidulko
2016 — conf
On Asymptotically Optimal Approach to the m-Peripatetic Salesman Problem on Random Inputs.
DOOR
Edward Kh. Gimadi, Alexey M. Istomin, Oxana Yu. Tsidulko