The vertex degrees of minimum spanning trees

被引：7
|
作者：
Cieslik, D [1 ]
机构：
[1] Univ Greifswald, Inst Math & Comp Sci, D-17487 Greifswald, Germany
来源：
EUROPEAN JOURNAL OF OPERATIONAL RESEARCH | 2000年 / 125卷 / 02期
关键词：
graph theory; minimum spanning trees;
D O I：
10.1016/S0377-2217(99)00458-0
中图分类号：
C93 [管理学];
学科分类号：
12 ; 1201 ; 1202 ; 120202 ;
摘要：
We study the problem of minimum spanning trees (MST) with degree constraints. It is well-known that this problem in general is, NP-hard. It will be shown that in finite-dimensional Banach spaces there is a number such that a bounded degree MST can be computed as efficiently as an ordinary MST if the degree constraint is greater than this number. (C) 2000 Elsevier Science B.V. All rights reserved.
引用
收藏
页码：278 / 282
页数：5
相关论文
共 50 条
12345