具有度界的网络设计问题的推广
On Generalizations of Network Design Problems with Degree Bounds
摘要：
迭代舍入和松弛可以说是处理无约束和有约束网络设计问题的首选方法。在本文中，我们扩展的迭代松弛法的范围在两个方向：（1）通过处理更复杂的程度约束的最小生成树问题（即，层流交叉生成树），及（2）通过将“度界”在其他组合优化问题，如拟阵相交和格多面体。我们给出了新的或改进的近似算法，硬度结果，和完整性的差距，这些问题。
英文摘要：
Iterative rounding and relaxation have arguably become the method of choice in dealing with unconstrained and constrained network design problems. In this paper we extend the scope of the iterative relaxation method in two directions: (1) by handling more complex degree constraints in the minimum spanning tree problem (namely, laminar crossing spanning tree), and (2) by incorporating `degree bounds' in other combinatorial optimization problems such as matroid intersection and lattice polyhedra. We give new or improved approximation algorithms, hardness results, and integrality gaps for these problems.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
