Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems

Details Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems

2009-11-11

arxiv.org/abs/0911.2214v3

Computer Science

Data Structures and Algorithms

15 pages. Minor changes to presentation from version 2

Scientific paper

We design the first polynomial time approximation schemes (PTASs) for the Minimum Betweenness problem in tournaments and some related higher arity ranking problems. This settles the approximation status of the Betweenness problem in tournaments along with other ranking problems which were open for some time now. The results depend on a new technique of dealing with fragile ranking constraints and could be of independent interest.

Affiliated with

Also associated with

No associations

Rating

Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Approximation Schemes for the Betweenness Problem in Tournaments and Related Ranking Problems will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-149396