arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1107.5329cs.DScs.DM
收藏

拟阵度有界最小生成树

Matroidal Degree-Bounded Minimum Spanning Trees

Rico Zenklusen

摘要:

我们考虑的最小生成树(MST)的限制下,对于每个顶点v,与v相邻的树的边缘满足一个给定的家庭的约束。其中一个著名的例子是经典的度约束MST问题,其中对于每个顶点v,对度施加一个简单的上限。迭代舍入/松弛算法成为度有界网络设计问题的首选工具。这一发展的基石是辛格和刘的工作,他们为度有界的MST问题展示了如何找到一棵违反每个度约束的生成树,最多只有一个单元,并且成本最多是尊重度边界的最佳解决方案的成本。然而,当前的迭代舍入方法在处理更一般的度约束时面临几个限制。特别地,当在与顶点v相邻的边上施加若干约束时,例如当给定与v相邻的边的划分并且仅可以从划分的每个集合中选择固定数量的元素时,当前方法可能通过常数违反每个约束,而不是通过最多恒定数量的边一起违反所有约束。此外,也不清楚先前的迭代舍入方法如何可以用于其中一些边缘处于超恒定数量的约束中的度约束。我们扩展迭代舍入/放松的方法都在概念层面上,以及涉及他们的分析,以解决这些限制方面。这导致了一个有效的算法的度约束MST问题,其中对于每个顶点v,v相邻的边缘必须是独立的,在一个给定的拟阵。该算法返回一个生成树T的成本最多为OPT,使得对于每个顶点v,它足以从T中删除最多8条边,以满足v处的拟阵度约束。

英文摘要:

We consider the minimum spanning tree (MST) problem under the restriction that for every vertex v, the edges of the tree that are adjacent to v satisfy a given family of constraints. A famous example thereof is the classical degree-constrained MST problem, where for every vertex v, a simple upper bound on the degree is imposed. Iterative rounding/relaxation algorithms became the tool of choice for degree-bounded network design problems. A cornerstone for this development was the work of Singh and Lau, who showed for the degree-bounded MST problem how to find a spanning tree violating each degree bound by at most one unit and with cost at most the cost of an optimal solution that respects the degree bounds. However, current iterative rounding approaches face several limits when dealing with more general degree constraints. In particular, when several constraints are imposed on the edges adjacent to a vertex v, as for example when a partition of the edges adjacent to v is given and only a fixed number of elements can be chosen out of each set of the partition, current approaches might violate each of the constraints by a constant, instead of violating all constraints together by at most a constant number of edges. Furthermore, it is also not clear how previous iterative rounding approaches can be used for degree constraints where some edges are in a super-constant number of constraints. We extend iterative rounding/relaxation approaches both on a conceptual level as well as aspects involving their analysis to address these limitations. This leads to an efficient algorithm for the degree-constrained MST problem where for every vertex v, the edges adjacent to v have to be independent in a given matroid. The algorithm returns a spanning tree T of cost at most OPT, such that for every vertex v, it suffices to remove at most 8 edges from T to satisfy the matroidal degree constraint at v.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑