arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 1708.03703cs.CC
收藏

广义顶点覆盖问题及其若干变式

The generalized vertex cover problem and some variations

Pooja Pandey, Abraham P. Punnen

摘要:

本文研究了广义顶点覆盖问题(GVC),它是各种已研究得很好的组合优化问题的推广。GVC被证明是等价的无约束二元二次规划问题,也相当于一般GVC的一些其他的变化。一些可解的情况下,确定和近似算法的特殊情况下,建议。我们还研究了二部图上的GVC,并确定了一些多项式可解的情况。我们证明了二部图上的GVC等价于二部无约束0-1二次规划问题。给出了GVC及其相关问题的广义规划公式,并建立了相应的线性规划松弛解在某些变量上的半整性。我们还讨论了GVC的特殊情况下,所有的可行解是独立集或顶点覆盖。这些问题等价于最大权独立集问题或最小权顶点覆盖问题,并给出了一些算法结果。

英文摘要:

In this paper we study the generalized vertex cover problem (GVC), which is a generalization of various well studied combinatorial optimization problems. GVC is shown to be equivalent to the unconstrained binary quadratic programming problem and also equivalent to some other variations of the general GVC. Some solvable cases are identified and approximation algorithms are suggested for special cases. We also study GVC on bipartite graphs and identify some polynomially solvable cases. We show that GVC on bipartite graphs is equivalent to the bipartite unconstrained 0-1 quadratic programming problem. Integer programming formulations of GVC and related problems are presented and establish half-integrality property on some variables for the corresponding linear programming relaxations. We also discuss special cases of GVC where all feasible solutions are independent sets or vertex covers. These problems are observed to be equivalent to the maximum weight independent set problem or minimum weight vertex cover problem along with some algorithmic results.

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

↑