Kneser与Schrijver问题的固定参数算法
Fixed-Parameter Algorithms for the Kneser and Schrijver Problems
AI总结:
研究了Kneser和Schrijver图的计算问题,证明了寻找单色边存在运行时间为n^{O(1)}·k^{O(k)}的固定参数随机算法,并将其应用于Agreeable-Set问题获得多项式时间算法。
摘要:
Kneser图K(n,k)针对满足n≥2k的整数n和k定义,其顶点为[n]={1,2,...,n}的所有k元子集,若两个这样的子集不相交则它们相邻。Schrijver图S(n,k)定义为K(n,k)的导出子图,由不包含模n连续两个元素的[n]的所有k元子集构成。已知K(n,k)和S(n,k)的色数均为n-2k+2。在计算Kneser和Schrijver问题中,给定对K(n,k)和S(n,k)顶点使用n-2k+1种颜色的着色访问,目标是找到一条单色边。我们证明这些问题存在运行时间为n^{O(1)}·k^{O(k)}的随机算法,因此关于参数k是固定参数可解的。分析涉及相交族及Kneser和Schrijver图导出子图的结构结果。我们还研究了Agreeable-Set问题,即为ℓ个智能体分配m个物品集合的一个小子集,使得所有智能体对该子集的估值至少与其补集相当。作为Kneser问题算法的应用,我们针对ℓ≥m-O(log m/log log m)的实例,获得了Agreeable-Set问题的随机多项式时间算法。我们进一步证明,Agreeable-Set问题至少与扩展输入着色访问的Kneser问题变体一样困难。
英文摘要:
The Kneser graph $K(n,k)$ is defined for integers $n$ and $k$ with $n \geq 2k$ as the graph whose vertices are all the $k$-subsets of $[n]=\{1,2,\ldots,n\}$ where two such sets are adjacent if they are disjoint. The Schrijver graph $S(n,k)$ is defined as the subgraph of $K(n,k)$ induced by the collection of all $k$-subsets of $[n]$ that do not include two consecutive elements modulo $n$. It is known that the chromatic number of both $K(n,k)$ and $S(n,k)$ is $n-2k+2$. In the computational Kneser and Schrijver problems, we are given an access to a coloring with $n-2k+1$ colors of the vertices of $K(n,k)$ and $S(n,k)$ respectively, and the goal is to find a monochromatic edge. We prove that the problems admit randomized algorithms with running time $n^{O(1)} \cdot k^{O(k)}$, hence they are fixed-parameter tractable with respect to the parameter $k$. The analysis involves structural results on intersecting families and on induced subgraphs of Kneser and Schrijver graphs. We also study the Agreeable-Set problem of assigning a small subset of a set of $m$ items to a group of $\ell$ agents, so that all agents value the subset at least as much as its complement. As an application of our algorithm for the Kneser problem, we obtain a randomized polynomial-time algorithm for the Agreeable-Set problem for instances with $\ell \geq m - O(\frac{\log m}{\log \log m})$. We further show that the Agreeable-Set problem is at least as hard as a variant of the Kneser problem with an extended access to the input coloring.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。