1-Skeletons of the Spanning Tree Problems with Additional Constraints
In this paper, we study polyhedral properties of two spanning tree problems with additional constraints. In the first problem, it is required to find a tree with a minimum sum of edge weights among all spanning trees with the number of leaves less than or equal to a given value. In the second proble...
Main Authors: | V. A. Bondarenko, A. V. Nikolaev, D. A. Shovgenov |
---|---|
Format: | Article |
Language: | English |
Published: |
Yaroslavl State University
2015-08-01
|
Series: | Modelirovanie i Analiz Informacionnyh Sistem |
Subjects: | |
Online Access: | https://www.mais-journal.ru/jour/article/view/265 |
Similar Items
-
Polyhedral Characteristics of Balanced and Unbalanced Bipartite Subgraph Problems
by: Vladimir Bondarenko, et al.
Published: (2017-04-01) -
NP-completeness of the Minimum Spanning Tree Problem of a Multiple Graph of Multiplicity k ≥ 3
by: Alexander Valeryevich Smirnov
Published: (2021-03-01) -
The Spanning Tree of a Divisible Multiple Graph
by: Alexander V. Smirnov
Published: (2018-08-01) -
Completely Independent Spanning Trees in (Partial) k-Trees
by: Matsushita Masayoshi, et al.
Published: (2015-08-01) -
Completely Independent Spanning Trees in k-Th Power of Graphs
by: Hong Xia
Published: (2018-08-01)