Add to ORKGWe design the first polynomial time approximation schemes (PTASs) for the Mini-mum Betweenness problem in tournaments and some related higher arity ranking prob-lems. This settles the approximation status of the Betweenness problem in tournaments along with other ranking problems which were open for some time now. We also show fixed parameter tractability of Betweenness in tournaments and improved fixed param-eter algorithms for Feedback Arc Set in tournaments and Kemeny Rank Aggregation. The results depend on a new technique of dealing with fragile ranking constraints and could be of independent interest
AbstractThe linear ordering problem consists in finding a linear order at minimum remoteness from a ...
AbstractComplementing recent progress on classical complexity and polynomial-time approximability of...
A knockout (or single-elimination) tournament is a format of a competition that is very popular in p...
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on...
Ranking is a fundamental activity for organising and, later, understanding data. Advice of the form ...
As various combinatorial optimization problems can be formulated as integer linear programs, polyhed...
This paper examines the problem of rank ordering a set of players or objects on the basis of a set o...
A tournament solution is a function that maps a tournament, i.e., a directed graph representing an a...
Abstract. We obtain a necessary and sufficient condition in terms of forbidden structures for tourna...
AbstractWe consider the feedback vertex set and feedback arc set problems on bipartite tournaments. ...
We propose a pattern for designing algorithms that run in polynomial time by construction and undera...
We obtain a necessary and sufficient condition for tournaments to possess a min-max relation on pack...
In this series of two papers we examine the classical problem of ranking a set of players on the bas...
In bridge team tournaments there often is not enough time for each team to compete against every oth...
We study the -rank of a real matrix A, defined for any > 0 as the minimum rank over matrices that...
AbstractThe linear ordering problem consists in finding a linear order at minimum remoteness from a ...
AbstractComplementing recent progress on classical complexity and polynomial-time approximability of...
A knockout (or single-elimination) tournament is a format of a competition that is very popular in p...
We present a polynomial time approximation scheme (PTAS) for the minimum feedback arc set problem on...
Ranking is a fundamental activity for organising and, later, understanding data. Advice of the form ...
As various combinatorial optimization problems can be formulated as integer linear programs, polyhed...
This paper examines the problem of rank ordering a set of players or objects on the basis of a set o...
A tournament solution is a function that maps a tournament, i.e., a directed graph representing an a...
Abstract. We obtain a necessary and sufficient condition in terms of forbidden structures for tourna...
AbstractWe consider the feedback vertex set and feedback arc set problems on bipartite tournaments. ...
We propose a pattern for designing algorithms that run in polynomial time by construction and undera...
We obtain a necessary and sufficient condition for tournaments to possess a min-max relation on pack...
In this series of two papers we examine the classical problem of ranking a set of players on the bas...
In bridge team tournaments there often is not enough time for each team to compete against every oth...
We study the -rank of a real matrix A, defined for any > 0 as the minimum rank over matrices that...
AbstractThe linear ordering problem consists in finding a linear order at minimum remoteness from a ...
AbstractComplementing recent progress on classical complexity and polynomial-time approximability of...
A knockout (or single-elimination) tournament is a format of a competition that is very popular in p...