[英]Algorithm(s) for the constrained degree + bounded diameter minimum spanning tree?
Suppose I have 3 kinds of restrictions to computing a spanning tree: 假设我有3种限制来计算生成树:
Are there any good algorithms to solve this that aren't gonna drive me insane? 是否有任何好的算法可以解决这个问题,这些算法不会让我疯狂吗? I'm gonna have to run this with rather large inpputs (1000+ nodes), so its complexity can't be too high either.
我将不得不使用相当大的inpputs(1000+节点)运行它,因此它的复杂性也不能太高。
The degree-constrained spanning tree problem is NP-complete. 度受约束的生成树问题是NP完全的。 See http://en.wikipedia.org/wiki/Degree-constrained_spanning_tree .
请参见http://en.wikipedia.org/wiki/Degree-constrained_spanning_tree 。 So, no good (ie, polynomial) algorithms.
所以,没有好的(即多项式)算法。 There are approximation algorithms, though.
但是有一些近似算法。
A Google search seems to indicate that the bounded diameter spanning tree problem is equally hard. 谷歌搜索似乎表明有限直径生成树问题同样困难。
声明:本站的技术帖子网页,遵循CC BY-SA 4.0协议,如果您需要转载,请注明本站网址或者原文地址。任何问题请咨询:yoyou2525@163.com.