The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments

@article{Charbit2006TheMF,
  title={The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments},
  author={Pierre Charbit and St{\'e}phan Thomass{\'e} and Anders Yeo},
  journal={Combinatorics, Probability and Computing},
  year={2006},
  volume={16},
  pages={1 - 4}
}
Answering a question of Bang-Jensen and Thomassen [4], we prove that the minimum feedback arc set problem is NP-hard for tournaments. 

Feedback arc set in bipartite tournaments is NP-complete

A Note on Arc-Disjoint Cycles in Bipartite Tournaments

We show that for each non-negative integer k, every bipartite tournament either contains k arc-disjoint cycles or has a feedback arc set of size at most 7(k - 1).

Some Parameterized Problems On Digraphs

A survey results and open questions on complexity of parameterized problems on digraphs and some new results are proved on parameterizations of the backward paired comparison problem.

Aspects of preprocessing applied to combinatorial graph problems

Die Printversion ist im Universitatsverlag der TU Berlin unter ISBN 978-3-7983-2508-1 erschienen und im Buchhandel lieferbar. .

Online Ranking for Tournament Graphs

Both the maximization and the minimization versions of the problem of producing a global ranking of items given pairwise ranking information on tournaments (max acyclic subgraph, feedback arc set) are studied.

An updated survey on the linear ordering problem for weighted or unweighted tournaments

It is shown how the linear ordering problem can be used to model an aggregation problem consisting of going from individual preferences defined on a set of candidates to a collective ranking of these candidates.

A survey on the linear ordering problem for weighted or unweighted tournaments

It is shown how the linear ordering problem can be used to model an aggregation problem consisting of going from individual preferences defined on a set of candidates to a collective ranking of these candidates.

A Quadratic Vertex Kernel for Feedback Arc Set in Bipartite Tournaments

By introducing a new concept called “bimodule”, this work provides a problem kernel with O(k2) vertices for k-FASBT, which improves the previous result by a factor of k.
...

References

SHOWING 1-6 OF 6 REFERENCES

Ranking Tournaments

  • N. Alon
  • Mathematics
    SIAM J. Discret. Math.
  • 2006
It is shown that the feedback arc set problem for tournaments is NP-hard under randomized reductions, which settles a conjecture of Bang-Jensen and Thomassen.

A Polynomial Algorithm for the 2-Path Problem for Semicomplete Digraphs

This paper presents polynomially bounded algorithms for finding a cycle through any two prescribed arcs in a semicomplete digraph and for finding a cycle through any two prescribed vertices in a

Aggregating inconsistent information: Ranking and clustering

This work almost settles a long-standing conjecture of Bang-Jensen and Thomassen and shows that unless NP⊆BPP, there is no polynomial time algorithm for the problem of minimum feedback arc set in tournaments.

Reducibility Among Combinatorial Problems

  • R. Karp
  • Computer Science
    50 Years of Integer Programming
  • 1972
Throughout the 1960s I worked on combinatorial optimization problems including logic circuit design with Paul Roth and assembly line balancing and the traveling salesman problem with Mike Held, which made me aware of the importance of distinction between polynomial-time and superpolynomial-time solvability.

The Probabilistic Method

A particular set of problems - all dealing with “good” colorings of an underlying set of points relative to a given family of sets - is explored.