The Problem of Finding Several Given Diameter Spanning Trees of Maximum Total Weight in a Complete Graph › Research Explorer

Novosibirsk State University's Research Portal

The Problem of Finding Several Given Diameter Spanning Trees of Maximum Total Weight in a Complete Graph

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

DOI

https://doi.org/10.1007/978-3-031-54534-4_24
Final published version

E. Kh Gimadi
A. A. Shtepa

Original language	English
Title of host publication	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Publisher	Springer
Pages	341-348
Number of pages	8
ISBN (Print)	9783031545337
DOIs	https://doi.org/10.1007/978-3-031-54534-4_24
Publication status	Published - 2024
Event	11th International Conference on Analysis of Images, Social Networks and Texts - Ереван, Armenia Duration: 28 Sept 2023 → 30 Sept 2023 Conference number: 11

Publication series

Name	Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume	14486 LNCS

Conference

Conference	11th International Conference on Analysis of Images, Social Networks and Texts
Abbreviated title	AIST 2023
Country/Territory	Armenia
City	Ереван
Period	28.09.2023 → 30.09.2023

Research areas

approximation algorithm, asymptotic optimality, given diameter Spanning Tree Problem, probabilistic analysis

OECD FOS+WOS

1.02 COMPUTER AND INFORMATION SCIENCES

ID: 60483607