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 › Research Explorer

Novosibirsk State University's Research Portal

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

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Research › peer-review

DOI

https://doi.org/10.1007/978-3-030-77876-7_5
Final published version

Edward Kh Gimadi
Aleksandr S. Shevyakov
Alexandr A. Shtepa

Original language	English
Title of host publication	Mathematical Optimization Theory and Operations Research - 20th International Conference, MOTOR 2021, Proceedings
Editors	Panos Pardalos, Michael Khachay, Alexander Kazakov
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	67-78
Number of pages	12
ISBN (Print)	9783030778750
DOIs	https://doi.org/10.1007/978-3-030-77876-7_5
Publication status	Published - 2021
Event	20th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2021 - Irkutsk, Russian Federation Duration: 5 Jul 2021 → 10 Jul 2021

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	12755 LNCS
ISSN (Print)	0302-9743
ISSN (Electronic)	1611-3349

Conference

Conference	20th International Conference on Mathematical Optimization Theory and Operations Research, MOTOR 2021
Country/Territory	Russian Federation
City	Irkutsk
Period	05.07.2021 → 10.07.2021

Research areas

Approximation algorithm, Asymptotic optimality, Given-diameter Minimum Spanning Tree, Probabilistic analysis

OECD FOS+WOS

1.01 MATHEMATICS
1.02 COMPUTER AND INFORMATION SCIENCES

ID: 34128399