Packing Feedback Arc Sets in Tournaments Exactly

Document Type

Article

Publication Date

2-1-2024

Abstract

Let T = (V, A) 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 T\F contains no cycles (directed). A collection F 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 F . The purpose of this paper is to give a characterization of all tournaments T = (V, A) 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.

Publication Source (Journal or Book title)

Mathematics of Operations Research

First Page

151

Last Page

170

This document is currently not available here.

Share

COinS