Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
Asymptotically Optimal Approach to a Given Diameter Undirected MST Problem on Random Input Data. / Gimadi, Edward; Shevyakov, Alexandr; Shin, Ekaterina.
2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019. Institute of Electrical and Electronics Engineers Inc., 2019. p. 48-52 8880223 (2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019).Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review
}
TY - GEN
T1 - Asymptotically Optimal Approach to a Given Diameter Undirected MST Problem on Random Input Data
AU - Gimadi, Edward
AU - Shevyakov, Alexandr
AU - Shin, Ekaterina
N1 - Funding Information: Supported by the program of fundamental scientific researches of the SB RAS (project 0314-2019-0014), by RFBR (project 20-01-00583), and by the Ministry of Science and Higher Education of the Russian Federation under the 5-100 Excellence Programme.
PY - 2019/8
Y1 - 2019/8
N2 - We give an approximation deterministic algorithm for solving the Random Undirected MST with given diameter on n-vertex complete undirected graph. The problem is NP-hard. Algorithm has a quadratic time complexity. A probabilistic analysis was performed under conditions that edge weights of given graph are identically independent uniformly distributed random variables on an interval with positive ends. Sufficient conditions of asymptotic optimality are presented.
AB - We give an approximation deterministic algorithm for solving the Random Undirected MST with given diameter on n-vertex complete undirected graph. The problem is NP-hard. Algorithm has a quadratic time complexity. A probabilistic analysis was performed under conditions that edge weights of given graph are identically independent uniformly distributed random variables on an interval with positive ends. Sufficient conditions of asymptotic optimality are presented.
KW - asymptotically optimal approach
KW - minimum spanning tree
KW - performance guarantees
KW - probabilistic analysis
KW - random inputs
KW - undirected graph
KW - uniform
UR - http://www.scopus.com/inward/record.url?scp=85078045958&partnerID=8YFLogxK
U2 - 10.1109/OPCS.2019.8880223
DO - 10.1109/OPCS.2019.8880223
M3 - Conference contribution
AN - SCOPUS:85078045958
T3 - 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019
SP - 48
EP - 52
BT - 2019 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 15th International Asian School-Seminar Optimization Problems of Complex Systems, OPCS 2019
Y2 - 26 August 2019 through 30 August 2019
ER -
ID: 26009465