图划分的组合几何-- I
Combinatorial Geometry of Graph Partitioning - I
摘要:
{ \sc $c$ -平衡分离器}问题是一个图划分问题,其中给定图$G$,目标是找到最小尺寸的切割,使得切割的两侧至少具有$cn$顶点。在本文中,我们提出了新的进展方向的{ \sc $c$ -平衡分离器}问题。更具体地说,我们提出了一个家庭的数学计划,这取决于一个参数$p > 0$,是一个扩展的统一版本的SDPs提出的Goemans和Linial为这个问题。事实上,对于$p=1$的情况,如果可以在多项式时间内解决这个程序,那么简单地使用{ \sc Max Cut} \cite{WG95}的Goemans-Williamson随机舍入算法将给出{ \sc $c$ -平衡分离器}的$O(1)$ -因子近似算法,由于Arora,Rao和Vazirani \cite{ARV},改进了$O(\sqrt{\log n})$的最佳已知近似因子。这一系列的计划是不凸的,但可以将它们转换成所谓的\emph{\textbf{concave programs}},其中一个优化凸可行集上的凹函数。众所周知,这类规划的最优解位于可行集\cite{TTT85}的一个极值点上。我们的主要贡献是一个组合特征的一些极端点的可行集的数学规划,$p=1$的情况下,据我们所知,这是第一次。我们进一步展示了如何可以使用这种特性来解决在一个限制设置的程序。非凸计划最近已调查Bhaskara和Vijayaraghvan \cite{BV11},他们设计的算法近似矩阵$p$ -规范,虽然他们的算法技术是分析性质。
英文摘要:
The {\sc $c$-Balanced Separator} problem is a graph-partitioning problem in which given a graph $G$, one aims to find a cut of minimum size such that both the sides of the cut have at least $cn$ vertices. In this paper, we present new directions of progress in the {\sc $c$-Balanced Separator} problem. More specifically, we propose a family of mathematical programs, that depend upon a parameter $p > 0$, and is an extension of the uniform version of the SDPs proposed by Goemans and Linial for this problem. In fact for the case, when $p=1$, if one can solve this program in polynomial time then simply using the Goemans-Williamson's randomized rounding algorithm for {\sc Max Cut} \cite{WG95} will give an $O(1)$-factor approximation algorithm for {\sc $c$-Balanced Separator} improving the best known approximation factor of $O(\sqrt{\log n})$ due to Arora, Rao and Vazirani \cite{ARV}. This family of programs is not convex but one can transform them into so called \emph{\textbf{concave programs}} in which one optimizes a concave function over a convex feasible set. It is well known that the optima of such programs lie at one of the extreme points of the feasible set \cite{TTT85}. Our main contribution is a combinatorial characterization of some extreme points of the feasible set of the mathematical program, for $p=1$ case, which to the best of our knowledge is the first of its kind. We further demonstrate how this characterization can be used to solve the program in a restricted setting. Non-convex programs have recently been investigated by Bhaskara and Vijayaraghvan \cite{BV11} in which they design algorithms for approximating Matrix $p$-norms although their algorithmic techniques are analytical in nature.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。