图形房屋分配的紧近似
Tight Approximations for Graphical House Allocation
AI总结:
本文完整刻画了图形房屋分配问题的可近似性,为多类图提出匹配上下界的近似算法,并给出基于树宽等结构参数的通用近似比及特殊图类的常数因子方案。
摘要:
图形房屋分配问题提出如下问题:如何将 $n$ 栋房屋(每栋具有固定的非负价值)分配给无向图 $G$ 的顶点,以最小化“总局部嫉妒”,即沿 $G$ 的边上的绝对差之和?该问题推广了经典的最小线性排列问题,以及经济学中著名的房屋分配问题,后者在器官交换中具有显著的实际应用。近期工作研究了图形房屋分配的计算方面,并观察到该问题即使在特别简单的图类(如路径的不相交并集)上也是 NP 难且不可近似的。然而,任何近似对底层图结构性质的依赖尚未被研究。\n 在本工作中,我们给出了图形房屋分配问题可近似性的完整刻画。我们提出了在一般图、树、平面图、有界度图、有界度平面图和有界度树上近似最优嫉妒的算法。对于这些图类中的每一个,我们随后证明了匹配的下界,表明在每种情况下,除非 P = NP,否则无法获得显著改进。我们还提出了作为底层图的结构参数(如树宽)的函数的通用近似比;这些在一般情况下匹配上述紧上界,并且对于许多自然的图子类显著更好的近似。最后,我们针对完全二叉树和随机图的特殊类别提出了常数因子近似方案。
英文摘要:
The Graphical House Allocation problem asks: how can $n$ houses (each with a fixed non-negative value) be assigned to the vertices of an undirected graph $G$, so as to minimize the "aggregate local envy", i.e., the sum of absolute differences along the edges of $G$? This problem generalizes the classical Minimum Linear Arrangement problem, as well as the well-known House Allocation Problem from Economics, the latter of which has notable practical applications in organ exchanges. Recent work has studied the computational aspects of Graphical House Allocation and observed that the problem is NP-hard and inapproximable even on particularly simple classes of graphs, such as vertex disjoint unions of paths. However, the dependence of any approximations on the structural properties of the underlying graph had not been studied. In this work, we give a complete characterization of the approximability of the Graphical House Allocation problem. We present algorithms to approximate the optimal envy on general graphs, trees, planar graphs, bounded-degree graphs, bounded-degree planar graphs, and bounded-degree trees. For each of these graph classes, we then prove matching lower bounds, showing that in each case, no significant improvement can be attained unless P = NP. We also present general approximation ratios as a function of structural parameters of the underlying graph, such as treewidth; these match the aforementioned tight upper bounds in general, and are significantly better approximations for many natural subclasses of graphs. Finally, we present constant factor approximation schemes for the special classes of complete binary trees and random graphs.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。