预热启动 Push-Relabel 算法
Warm-starting Push-Relabel
AI总结:
本文首次为预热启动 Push-Relabel 算法提供理论保证,利用预测流和间隙重标记启发式,在预测接近最优时加速,同时保持最坏情况稳健性,实验验证其有效性。
摘要:
Push-Relabel 是最著名的网络流算法之一。通过维护一个饱和割的预流,它在理论和经验运行时间上都优于其他流算法,如 Ford-Fulkerson。在实践中,Push-Relabel 甚至比理论保证所承诺的还要快,部分原因是使用了良好的启发式方法来初始化和更新迭代算法。然而,如何在任意初始化(不一定是预流或割饱和的)上运行 Push-Relabel 仍不清楚。我们首次为使用预测流预热启动 Push-Relabel 提供了理论保证,其中我们的学习增强版本在预测流接近最优流时享有快速运行时间,同时保持稳健的最坏情况保证。有趣的是,我们的算法使用了间隙重标记启发式方法,该方法在实践中早已使用,尽管在我们工作之前,对于它为何能带来运行时间改进,没有严格的理论证明。随后,我们提供了实验,表明我们的预热启动 Push-Relabel 在实践中也表现良好。
英文摘要:
Push-Relabel is one of the most celebrated network flow algorithms. Maintaining a pre-flow that saturates a cut, it enjoys better theoretical and empirical running time than other flow algorithms, such as Ford-Fulkerson. In practice, Push-Relabel is even faster than what theoretical guarantees can promise, in part because of the use of good heuristics for seeding and updating the iterative algorithm. However, it remains unclear how to run Push-Relabel on an arbitrary initialization that is not necessarily a pre-flow or cut-saturating. We provide the first theoretical guarantees for warm-starting Push-Relabel with a predicted flow, where our learning-augmented version benefits from fast running time when the predicted flow is close to an optimal flow, while maintaining robust worst-case guarantees. Interestingly, our algorithm uses the gap relabeling heuristic, which has long been employed in practice, even though prior to our work there was no rigorous theoretical justification for why it can lead to run-time improvements. We then provide experiments that show our warm-started Push-Relabel also works well in practice.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。