A better LP rounding for feedback arc set on tournaments

IF 0.9 4区计算机科学 Q3 COMPUTER SCIENCE, THEORY & METHODS

Theoretical Computer Science Pub Date : 2024-08-06 DOI:10.1016/j.tcs.2024.114768

引用次数: 0

Abstract

We present a randomized algorithm to approximate the feedback arc set problem on weighted tournaments, a classic well-studied NP-hard problem. Our algorithm is based on rounding its standard linear programming relaxation. It improves the previously best-known LP rounding algorithm by achieving an approximation factor of 2.127 (best known was 2.5). As a result, we have found a better upper bound for the integrality gap of the corresponding LP.

查看原文本刊更多论文

赛事反馈弧设置的 LP 舍入更合理

我们提出了一种近似加权锦标赛反馈弧集问题的随机算法，这是一个经过深入研究的经典 NP 难问题。我们的算法基于标准线性规划松弛的舍入。它改进了之前最著名的 LP 四舍五入算法，实现了 2.127 的近似系数（最著名的是 2.5）。因此，我们为相应 LP 的积分差距找到了更好的上界。

本文章由计算机程序翻译，如有差异，请以英文原文为准。

求助全文

约1分钟内获得全文求助全文

来源期刊

Theoretical Computer Science 工程技术-计算机：理论方法

CiteScore

2.60

自引率

18.20%

发文量

471

审稿时长

12.6 months

期刊介绍： Theoretical Computer Science is mathematical and abstract in spirit, but it derives its motivation from practical and everyday computation. Its aim is to understand the nature of computation and, as a consequence of this understanding, provide more efficient methodologies. All papers introducing or studying mathematical, logic and formal concepts and methods are welcome, provided that their motivation is clearly drawn from the field of computing.