The feedback arc set problem with triangle inequality is a vertex cover problem

Authors:
Monaldo Mastrolilli
Affiliations:
IDSIA, Lugano, Switzerland
Venue:
LATIN'12 Proceedings of the 10th Latin American international conference on Theoretical Informatics
Year:
2012

Citing 19
Cited 0

A parallel approximation algorithm for positive linear programming

STOC '93 Proceedings of the twenty-fifth annual ACM symposium on Theory of computing
Fast approximation algorithms for fractional packing and covering problems

Mathematics of Operations Research
Approximate set covering in uniform hypergraphs

Journal of Algorithms
Scheduling to minimize average completion time: off-line and on-line approximation algorithms

Mathematics of Operations Research
Divide-and-conquer approximation algorithms via spreading metrics

Journal of the ACM (JACM)
Approximation algorithms

Approximation algorithms
Single-Machine Scheduling with Precedence Constraints

Mathematics of Operations Research
How to rank with few errors

Proceedings of the thirty-ninth annual ACM symposium on Theory of computing
Deterministic pivoting algorithms for constrained ranking and clustering problems

SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Inapproximability Results for Sparsest Cut, Optimal Linear Arrangement, and Precedence Constrained Scheduling

FOCS '07 Proceedings of the 48th Annual IEEE Symposium on Foundations of Computer Science
Aggregating inconsistent information: Ranking and clustering

Journal of the ACM (JACM)
Scheduling with Precedence Constraints of Low Fractional Dimension

IPCO '07 Proceedings of the 12th international conference on Integer Programming and Combinatorial Optimization
Beating the Random Ordering is Hard: Inapproximability of Maximum Acyclic Subgraph

FOCS '08 Proceedings of the 2008 49th Annual IEEE Symposium on Foundations of Computer Science
Single Machine Precedence Constrained Scheduling Is a Vertex Cover Problem

Algorithmica
Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems

Mathematics of Operations Research
Aggregation of Partial Rankings, p-Ratings and Top-m Lists

Algorithmica
Optimal Long Code Test with One Free Bit

FOCS '09 Proceedings of the 2009 50th Annual IEEE Symposium on Foundations of Computer Science
Vertex cover in graphs with locally few colors

ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Approximating precedence-constrained single machine scheduling by coloring

APPROX'06/RANDOM'06 Proceedings of the 9th international conference on Approximation Algorithms for Combinatorial Optimization Problems, and 10th international conference on Randomization and Computation

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.