arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1311.5481cs.DS
收藏

约束匹配的双准则和近似算法

Bi-Criteria and Approximation Algorithms for Restricted Matchings

Monaldo Mastrolilli, Georgios Stamoulis

摘要:

在这项工作中,我们研究近似算法的\textit{Bounded Color Matching}问题(a.k.a.限制匹配问题),定义如下:给定一个图,其中每个边$e$都有一个颜色$c_e$和一个利润$p_e \in \mathbb{Q}^+$,我们想计算一个最大(基数或利润)匹配,其中不超过$w_j \in \mathbb{Z}^+$颜色$c_j$的边。除了理论上的兴趣之外,这种问题还出现在多光纤光学网络系统中,在该系统中,我们将可以通过光纤传播的每个独特波长解释为颜色类别,并且我们希望在系统对之间建立通信。我们研究这个问题的近似和双标准算法,这是基于线性规划技术,特别是在多面体表征的自然线性制定的问题。在我们的设置中,我们允许违反边界$w_j$,我们将我们的问题建模为双标准问题:我们有两个目标进行优化,即(a)最大化利润(最大匹配),同时(b)最小化对颜色边界的违反。我们证明了我们如何可以“击败”的自然线性规划制定的问题的完整性差距,只允许轻微违反的颜色界限。特别是,我们的主要结果是\textit{constant}逼近界的两个标准相应的双标准优化问题。

英文摘要:

In this work we study approximation algorithms for the \textit{Bounded Color Matching} problem (a.k.a. Restricted Matching problem) which is defined as follows: given a graph in which each edge $e$ has a color $c_e$ and a profit $p_e \in \mathbb{Q}^+$, we want to compute a maximum (cardinality or profit) matching in which no more than $w_j \in \mathbb{Z}^+$ edges of color $c_j$ are present. This kind of problems, beside the theoretical interest on its own right, emerges in multi-fiber optical networking systems, where we interpret each unique wavelength that can travel through the fiber as a color class and we would like to establish communication between pairs of systems. We study approximation and bi-criteria algorithms for this problem which are based on linear programming techniques and, in particular, on polyhedral characterizations of the natural linear formulation of the problem. In our setting, we allow violations of the bounds $w_j$ and we model our problem as a bi-criteria problem: we have two objectives to optimize namely (a) to maximize the profit (maximum matching) while (b) minimizing the violation of the color bounds. We prove how we can "beat" the integrality gap of the natural linear programming formulation of the problem by allowing only a slight violation of the color bounds. In particular, our main result is \textit{constant} approximation bounds for both criteria of the corresponding bi-criteria optimization problem.

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

↑