A Given Diameter MST on a Random Graph › Research Explorer

DOI

https://doi.org/10.1007/978-3-030-62867-3_9
Final published version

Edward K. Gimadi
Aleksandr S. Shevyakov
Alexandr A. Shtepa

Original language	English
Title of host publication	Optimization and Applications - 11th International Conference, OPTIMA 2020, Proceedings
Editors	Nicholas Olenev, Yuri Evtushenko, Michael Khachay, Vlasta Malkova
Publisher	Springer Science and Business Media Deutschland GmbH
Pages	110-121
Number of pages	12
ISBN (Print)	9783030628666
DOIs	https://doi.org/10.1007/978-3-030-62867-3_9
Publication status	Published - 2020
Event	11th International Conference on Optimization and Applications, OPTIMA 2020 - Moscow, Russian Federation Duration: 28 Sept 2020 → 2 Oct 2020

Publication series

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

Conference

Conference	11th International Conference on Optimization and Applications, OPTIMA 2020
Country/Territory	Russian Federation
City	Moscow
Period	28.09.2020 → 02.10.2020

Research areas

Approximation algorithm, Given-diameter minimum spanning tree, Probabilistic analysis

ID: 26703326