The feedback arc set problem with triangle inequality is a vertex cover problem
type: Item
instance of: scholarly article
title: The feedback arc set problem with triangle inequality is a vertex cover problem
zbMATH Open document ID: 1306.05079
author: Monaldo Mastrolilli
published in: Algorithmica
publication date: 2015-01-19T00:00:00Z
Mathematics Subject Classification ID: 05C20
Mathematics Subject Classification ID: 05C85
Mathematics Subject Classification ID: 05C35
Mathematics Subject Classification ID: 05C65
Mathematics Subject Classification ID: 68R10
Mathematics Subject Classification ID: 68W25
Mathematics Subject Classification ID: 90C10
zbMATH DE Number: 6387692
zbMATH Keywords: feedback arc set problem
zbMATH Keywords: approximation algorithms
zbMATH Keywords: integer linear program formulation
MaRDI profile type: Publication
full work available at URL: s00453-013-9811-2
OpenAlex ID: W2173656554
cites work: On a theorem of Lovász on covers in \(r\)-partite hypergraphs
cites work: Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
cites work: Improved Approximation Algorithms for Bipartite Correlation Clustering
cites work: Aggregating inconsistent information
cites work: Single machine precedence constrained scheduling is a Vertex cover problem
cites work: Q3396634
cites work: On the approximability of single-machine scheduling with precedence constraints
cites work: Optimal Long Code Test with One Free Bit
cites work: Single-Machine Scheduling with Precedence Constraints
cites work: Divide-and-conquer approximation algorithms via spreading metrics
cites work: Approximating minimum feedback sets and multicuts in directed graphs
cites work: Q3680606
cites work: Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
cites work: Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
cites work: On the approximability of the maximum common subgraph problem
cites work: Reducibility among Combinatorial Problems
cites work: Q3549601
cites work: Approximate Set Covering in Uniform Hypergraphs
cites work: Vertex cover in graphs with locally few colors
cites work: Q5586080
cites work: Q4719750
cites work: Polynomial time approximation algorithms for machine scheduling: Ten open problems
cites work: Packing directed circuits fractionally
cites work: Q4004146
cites work: Q2934620
cites work: Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
cites work: Q4782696
DOI: 10.1007/S00453-013-9811-2
description: scientific article; zbMATH DE number 6387692