Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
From MaRDI portal
Publication:534571
DOI10.1016/J.TCS.2010.10.047zbMATH Open1216.68344OpenAlexW2115051629MaRDI QIDQ534571FDOQ534571
Publication date: 18 May 2011
Published in: Theoretical Computer Science (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.tcs.2010.10.047
Recommendations
- Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
- Feedback arc set problem in bipartite tournaments
- Feedback Arc Set Problem in Bipartite Tournaments
- An approximation algorithm for feedback vertex sets in tournaments
- A Min-Max Theorem on Feedback Vertex Sets
Linear programming (90C05) Directed graphs (digraphs), tournaments (05C20) Graph theory (including graph drawing) in computer science (68R10) Approximation algorithms (68W25)
Cites Work
- Aggregating inconsistent information
- Title not available (Why is that?)
- Approximating minimum feedback sets and multicuts in directed graphs
- Feedback arc set problem in bipartite tournaments
- Title not available (Why is that?)
- Title not available (Why is that?)
- A Min-Max Theorem on Feedback Vertex Sets
- Feedback arc set in bipartite tournaments is NP-complete
- An approximation algorithm for feedback vertex sets in tournaments
- Improved approximation algorithm for the feedback set problem in a bipartite tournament
- Deterministic Pivoting Algorithms for Constrained Ranking and Clustering Problems
Cited In (10)
- A Min-Max Theorem on Feedback Vertex Sets
- MINIMUM FEEDBACK ARC SETS IN ROTATOR AND INCOMPLETE ROTATOR GRAPHS
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments
- Circular convex bipartite graphs: feedback vertex sets
- Feedback vertex sets on restricted bipartite graphs
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
- Vertex deletion on split graphs: beyond 4-hitting set
- Parameterized algorithms for feedback set problems and their duals in tournaments
- Fixed-parameter tractability results for feedback set problems in tournaments
This page was built for publication: Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q534571)
