面向多角恋调度问题的截止时间驱动算法
A Deadline-Driven Algorithm for Polyamorous Scheduling
浏览论文内容
中文总结 AI 辅助
针对多角恋调度问题，提出一种受截止时间驱动启发式启发的$4 G^*$算法，将近似比从$3+\sqrt{5}$改进为4，该问题推广了竹园修剪问题。
中文摘要 AI 辅助
在多角恋调度问题中，给定一个边加权图，需要找到该图中匹配的周期性调度，以最小化同一条边连续出现之间的最大加权等待时间。该NP难问题推广了竹园修剪问题，其动机源于在复杂社交群体中寻找成对会面调度的需求。我们提出了一种针对多角恋调度的$4 G^*$算法，将先前已知的$3 + \sqrt{5} \approx 5.236$界改进为4。我们的算法受截止时间驱动启发式算法的启发，该启发式算法对于竹园修剪问题（BGT）是最优的。
英文摘要
In Polyamorous Scheduling Problem, we are given an edge-weighted graph and must find a periodic schedule of matchings in this graph which minimizes the maximal weighted waiting time between consecutive occurrences of the same edge. This NP-hard problem generalises Bamboo Garden Trimming and is motivated by the need to find schedules of pairwise meetings in a complex social group. We present a $4 G^*$ algorithm for Polyamorous Scheduling, improving the previously known bound of $3 + \sqrt{5} \approx 5.236$. Our algorithm is inspired by the Deadline-Driven Heuristic which is optimal for Bamboo Garden Trimming (BGT).
发表机构
- Chennai Mathematical Institute（金奈数学研究所）
机构由 AI 辅助整理，请以论文原文为准。
