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

Authors:
Pierre Charbit;Stéphan Thomassé;Anders Yeo
Affiliations:
Laboratoire Camille Jordan, Université Claude Bernard, Lyon 1, France (e-mail: charbit@univ-lyon1.fr, thomasse@univ-lyon1.fr);Laboratoire Camille Jordan, Université Claude Bernard, Lyon 1, France (e-mail: charbit@univ-lyon1.fr, thomasse@univ-lyon1.fr);Department of Computer Science, Royal Holloway, University of London, Egham, Surrey TW20 0EX, UK (e-mail: anders@cs.rhul.ac.uk)
Venue:
Combinatorics, Probability and Computing
Year:
2007

Citing 3
Cited 23

A polynomial algorithm for the 2-path problem for semicomplete digraphs

SIAM Journal on Discrete Mathematics
Aggregating inconsistent information: ranking and clustering

Proceedings of the thirty-seventh annual ACM symposium on Theory of computing
Ranking Tournaments

SIAM Journal on Discrete Mathematics

Feedback arc set in bipartite tournaments is NP-complete

Information Processing Letters
Hardness of fully dense problems

Information and Computation
Feedback arc set problem in bipartite tournaments

Information Processing Letters
Ranking tournaments: Local search and a new algorithm

Journal of Experimental Algorithmics (JEA)
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems

Mathematics of Operations Research
Fixed-parameter tractability results for feedback set problems in tournaments

Journal of Discrete Algorithms
Directed graphs without short cycles

Combinatorics, Probability and Computing
Note: A tournament of order 14 with disjoint Banks and Slater sets

Discrete Applied Mathematics
H-join decomposable graphs and algorithms with runtime single exponential in rankwidth

Discrete Applied Mathematics
Feedback arc set problem in bipartite tournaments

TAMC'07 Proceedings of the 4th international conference on Theory and applications of models of computation
Ordering by weighted number of wins gives a good ranking for weighted tournaments

ACM Transactions on Algorithms (TALG)
A polynomial time approximation scheme for k-consensus clustering

SODA '10 Proceedings of the twenty-first annual ACM-SIAM symposium on Discrete Algorithms
Comparing multiagent systems research in combinatorial auctions and voting

Annals of Mathematics and Artificial Intelligence
Online ranking for tournament graphs

WAOA'10 Proceedings of the 8th international conference on Approximation and online algorithms
Kernels for feedback arc set in tournaments

Journal of Computer and System Sciences
Conflict packing yields linear vertex-kernels for k-FAST, k-dense RTI and a related problem

MFCS'11 Proceedings of the 36th international conference on Mathematical foundations of computer science
Fixed-parameter tractability results for feedback set problems in tournaments

CIAC'06 Proceedings of the 6th Italian conference on Algorithms and Complexity
A polynomial kernel for feedback arc set on bipartite tournaments

ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
A quadratic vertex kernel for feedback arc set in bipartite tournaments

MFCS'12 Proceedings of the 37th international conference on Mathematical Foundations of Computer Science
Putting human assessments of machine translation systems in order

WMT '12 Proceedings of the Seventh Workshop on Statistical Machine Translation
Computing a profit-maximizing sequence of offers to agents in a social network

WINE'12 Proceedings of the 8th international conference on Internet and Network Economics
Quasi-hamiltonian paths in semicomplete multipartite digraphs

Discrete Applied Mathematics
A Polynomial Kernel for Feedback Arc Set on Bipartite Tournaments

Theory of Computing Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

Answering a question of Bang-Jensen and Thomassen [4], we prove that the minimum feedback arc set problem is NP-hard for tournaments.