The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem

Details The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem

2011-11-18

arxiv.org/abs/1111.4299v2

Computer Science

Data Structures and Algorithms

Scientific paper

We consider the (precedence constrained) Minimum Feedback Arc Set problem with triangle inequalities on the weights, which finds important applications in problems of ranking with inconsistent information. We present a surprising structural insight showing that the problem is a special case of the minimum vertex cover in hypergraphs with edges of size at most 3. This result leads to combinatorial approximation algorithms for the problem and opens the road to studying the problem as a vertex cover problem.

Affiliated with

Also associated with

No associations

Rating

The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem 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 The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and The Feedback Arc Set Problem with Triangle Inequality is a Vertex Cover Problem will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-548859