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...
Saved in:
| Main Authors: | V. A. Bondarenko, A. V. Nikolaev, D. A. Shovgenov |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Yaroslavl State University
2015-08-01
|
| Series: | Моделирование и анализ информационных систем |
| Subjects: | |
| Online Access: | https://www.mais-journal.ru/jour/article/view/265 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
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) -
SK-TreePCN: Skeleton-Embedded Transformer Model for Point Cloud Completion of Individual Trees from Simulated to Real Data
by: Haifeng Xu, et al.
Published: (2025-02-01) -
Exact algorithm for the problem of the minimum complete spanning tree of a divisible multiple graph
by: Alexander V. Smirnov
Published: (2025-06-01)