Packing Feedback Arc Sets in Tournaments Exactly

Author:

Chen Xujin12ORCID,Ding Guoli3,Zang Wenan4ORCID,Zhao Qiulan5ORCID

Affiliation:

1. Academy of Mathematics and Systems Science, Chinese Academy of Sciences, Beijing 100190, China;

2. School of Mathematical Sciences, University of Chinese Academy of Sciences, Beijing 100049, China;

3. Mathematics Department, Louisiana State University, Baton Rouge, Louisiana 70803;

4. Department of Mathematics, The University of Hong Kong, Hong Kong, China;

5. Department of Mathematics, Nanjing University, Nanjing 210093, China

Abstract

Let [Formula: see text] be a tournament with a nonnegative integral weight w(e) on each arc e. A subset F of arcs is called a feedback arc set (FAS) if [Formula: see text] contains no cycles (directed). A collection [Formula: see text] of FASs (with repetition allowed) is called an FAS packing if each arc e is used at most w(e) times by the members of [Formula: see text]. The purpose of this paper is to give a characterization of all tournaments [Formula: see text] with the property that, for every nonnegative integral weight function w defined on A, the minimum total weight of a cycle is equal to the maximum size of an FAS packing. Funding: This work was supported by the National Natural Science Foundation of China [Grants 11801266 and 11971228]; the Chinese Academy of Sciences [Grants XDA27000000 and ZDBS-LY-7008]; the Ministry of Science and Technology of China [Grant 2018AAA0101002]; the Research Grants Council of Hong Kong; the Fundamental Research Funds for the Central Universities [Grant 020314380035].

Publisher

Institute for Operations Research and the Management Sciences (INFORMS)

Subject

Management Science and Operations Research,Computer Science Applications,General Mathematics

同舟云学术

1.学者识别学者识别

2.学术分析学术分析

3.人才评估人才评估

"同舟云学术"是以全球学者为主线,采集、加工和组织学术论文而形成的新型学术文献查询和分析系统,可以对全球学者进行文献检索和人才价值评估。用户可以通过关注某些学科领域的顶尖人物而持续追踪该领域的学科进展和研究前沿。经过近期的数据扩容,当前同舟云学术共收录了国内外主流学术期刊6万余种,收集的期刊论文及会议论文总量共计约1.5亿篇,并以每天添加12000余篇中外论文的速度递增。我们也可以为用户提供个性化、定制化的学者数据。欢迎来电咨询!咨询电话:010-8811{复制后删除}0370

www.globalauthorid.com

TOP

Copyright © 2019-2024 北京同舟云网络信息技术有限公司
京公网安备11010802033243号  京ICP备18003416号-3