Approximation schemes for the betweenness problem in tournaments and related ranking problems

Authors:
Marek Karpinski;Warren Schudy
Affiliations:
Dept. of Computer Science, University of Bonn;IBM T.J. Watson Research Center
Venue:
APPROX'11/RANDOM'11 Proceedings of the 14th international workshop and 15th international conference on Approximation, randomization, and combinatorial optimization: algorithms and techniques
Year:
2011

Citing 13
Cited 1

Polynomial time approximation schemes for dense instances of NP-hard problems

STOC '95 Proceedings of the twenty-seventh annual ACM symposium on Theory of computing
A Geometric Approach to Betweenness

SIAM Journal on Discrete Mathematics
Random sampling and approximation of MAX-CSP problems

STOC '02 Proceedings of the thiry-fourth annual ACM symposium on Theory of computing
Polynomial time approximation schemes for dense instances of minimum constraint satisfaction

Random Structures & Algorithms
How to rank with few errors

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Hardness of fully dense problems

Information and Computation
Aggregation of partial rankings, p-ratings and top-m lists

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Yet another algorithm for dense max cut: go greedy

Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Aggregating inconsistent information: Ranking and clustering

Journal of the ACM (JACM)
Linear time approximation schemes for the Gale-Berlekamp game and related minimization problems

Proceedings of the forty-first annual ACM symposium on Theory of computing
Fast FAST

ICALP '09 Proceedings of the 36th International Colloquium on Automata, Languages and Programming: Part I
Every Permutation CSP of arity 3 is Approximation Resistant

CCC '09 Proceedings of the 2009 24th Annual IEEE Conference on Computational Complexity
Betweenness parameterized above tight lower bound

Journal of Computer and System Sciences

Kernel and fast algorithm for dense triplet inconsistency

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

We settle the approximability status of the Minimum Betweenness problem in tournaments by designing a polynomial time approximation scheme (PTAS). No constant factor approximation was previously known. We also introduce a more general class of so-called fragile ranking problems and construct PTASs for them. The results depend on a new technique of dealing with fragile ranking constraints and could be of independent interest.