The feedback arc set problem with triangle inequality is a vertex cover problem (Q486997): Difference between revisions

@@ Property / Mathematics Subject Classification ID @@
+C20
@@ Property / Mathematics Subject Classification ID: 05C20 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C85
@@ Property / Mathematics Subject Classification ID: 05C85 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C35
@@ Property / Mathematics Subject Classification ID: 05C35 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C65
@@ Property / Mathematics Subject Classification ID: 05C65 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+R10
@@ Property / Mathematics Subject Classification ID: 68R10 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+W25
@@ Property / Mathematics Subject Classification ID: 68W25 / rank @@
+Normal rank
@@ Property / Mathematics Subject Classification ID @@
+C10
@@ Property / Mathematics Subject Classification ID: 90C10 / rank @@
+Normal rank
@@ Property / zbMATH DE Number @@
+6387692
@@ Property / zbMATH DE Number: 6387692 / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+feedback arc set problem
@@ Property / zbMATH Keywords: feedback arc set problem / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+approximation algorithms
@@ Property / zbMATH Keywords: approximation algorithms / rank @@
+Normal rank
@@ Property / zbMATH Keywords @@
+integer linear program formulation
@@ Property / zbMATH Keywords: integer linear program formulation / rank @@
+Normal rank
@@ Property / MaRDI profile type @@
+MaRDI publication profile
@@ Property / MaRDI profile type: MaRDI publication profile / rank @@
+Normal rank
@@ Property / full work available at URL @@
+https://doi.org/10.1007/s00453-013-9811-2
+Normal rank
@@ Property / OpenAlex ID @@
+W2173656554
@@ Property / OpenAlex ID: W2173656554 / rank @@
+Normal rank
@@ Property / cites work @@
+On a theorem of Lovász on covers in \(r\)-partite hypergraphs
+Normal rank
@@ Property / cites work @@
+Aggregation of partial rankings, \(p\)-ratings and top-\(m\) lists
+Normal rank
@@ Property / cites work @@
+Improved Approximation Algorithms for Bipartite Correlation Clustering
+Normal rank
@@ Property / cites work @@
+Aggregating inconsistent information
@@ Property / cites work: Aggregating inconsistent information / rank @@
+Normal rank
@@ Property / cites work @@
+Single machine precedence constrained scheduling is a Vertex cover problem
+Normal rank
@@ Property / cites work @@
+Q3396634
@@ Property / cites work: Q3396634 / rank @@
+Normal rank
@@ Property / cites work @@
+On the Approximability of Single-Machine Scheduling with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Optimal Long Code Test with One Free Bit
@@ Property / cites work: Optimal Long Code Test with One Free Bit / rank @@
+Normal rank
@@ Property / cites work @@
+Single-Machine Scheduling with Precedence Constraints
+Normal rank
@@ Property / cites work @@
+Divide-and-conquer approximation algorithms via spreading metrics
+Normal rank
@@ Property / cites work @@
+Approximating minimum feedback sets and multicuts in directed graphs
+Normal rank
@@ Property / cites work @@
+Q3680606
@@ Property / cites work: Q3680606 / rank @@
+Normal rank
@@ Property / cites work @@
+Beating the Random Ordering Is Hard: Every Ordering CSP Is Approximation Resistant
+Normal rank
@@ Property / cites work @@
+Scheduling to Minimize Average Completion Time: Off-Line and On-Line Approximation Algorithms
+Normal rank
@@ Property / cites work @@
+On the approximability of the maximum common subgraph problem
+Normal rank
@@ Property / cites work @@
+Reducibility among Combinatorial Problems
@@ Property / cites work: Reducibility among Combinatorial Problems / rank @@
+Normal rank
@@ Property / cites work @@
+Q3549601
@@ Property / cites work: Q3549601 / rank @@
+Normal rank
@@ Property / cites work @@
+Approximate Set Covering in Uniform Hypergraphs
@@ Property / cites work: Approximate Set Covering in Uniform Hypergraphs / rank @@
+Normal rank
@@ Property / cites work @@
+Vertex cover in graphs with locally few colors
@@ Property / cites work: Vertex cover in graphs with locally few colors / rank @@
+Normal rank
@@ Property / cites work @@
+Q5586080
@@ Property / cites work: Q5586080 / rank @@
+Normal rank
@@ Property / cites work @@
+Q4719750
@@ Property / cites work: Q4719750 / rank @@
+Normal rank
@@ Property / cites work @@
+Polynomial time approximation algorithms for machine scheduling: Ten open problems
+Normal rank
@@ Property / cites work @@
+Packing directed circuits fractionally
@@ Property / cites work: Packing directed circuits fractionally / rank @@
+Normal rank
@@ Property / cites work @@
+Q4004146
@@ Property / cites work: Q4004146 / rank @@
+Normal rank
@@ Property / cites work @@
+Q2934620
@@ Property / cites work: Q2934620 / rank @@
+Normal rank
@@ Property / cites work @@
+Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
+Normal rank
@@ Property / cites work @@
+Q4782696
@@ Property / cites work: Q4782696 / rank @@
+Normal rank
@@ links / mardi / name / links / mardi / name @@
+Publication:486997