Tournament中介数问题的近似格式及相关排序问题
Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems
摘要:
针对竞赛图中的最小介数问题以及相关的高元数排序问题,设计了一阶多项式时间近似算法。这解决了比赛中介数问题的近似状态以及其他一些已经开放了一段时间的排名问题。结果依赖于一种新的技术处理脆弱的排名约束,并可能是独立的利益。
英文摘要:
We design the first polynomial time approximation schemes (PTASs) for the Minimum Betweenness problem in tournaments and some related higher arity ranking problems. This settles the approximation status of the Betweenness problem in tournaments along with other ranking problems which were open for some time now. The results depend on a new technique of dealing with fragile ranking constraints and could be of independent interest.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。