Pages that link to "Item:Q2719120"
From MaRDI portal
The following pages link to An approximation algorithm for feedback vertex sets in tournaments (Q2719120):
Displaying 28 items.
- Feedback vertex sets on restricted bipartite graphs (Q393042) (← links)
- Packing cycles exactly in polynomial time (Q421271) (← links)
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments (Q534571) (← links)
- Parameterized algorithms for feedback set problems and their duals in tournaments (Q820159) (← links)
- Fixed-parameter algorithms for cluster vertex deletion (Q987386) (← links)
- Packing cycles in graphs. II (Q1405116) (← links)
- Ranking tournaments with no errors. II: Minimax relation (Q1985451) (← links)
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- On ideal semicomplete digraphs (Q2296276) (← links)
- Feedback arc number and feedback vertex number of Cartesian product of directed cycles (Q2296552) (← links)
- On the kernelization of ranking \(r\)-CSPs: linear vertex-kernels for generalizations of feedback arc set and betweenness in tournaments (Q2345613) (← links)
- Improved FPT algorithm for feedback vertex set problem in bipartite tournament (Q2380045) (← links)
- Feedback arc set problem in bipartite tournaments (Q2380064) (← links)
- Induced acyclic tournaments in random digraphs: sharp concentration, thresholds and algorithms (Q2509535) (← links)
- Focused jump-and-repair constraint handling for fixed-parameter tractable graph problems closed under induced subgraphs (Q2689443) (← links)
- Two Hardness Results on Feedback Vertex Sets (Q3004674) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- A spin glass approach to the directed feedback vertex set problem (Q3302766) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
- Improved Bounds for Minimal Feedback Vertex Sets in Tournaments (Q4634408) (← links)
- Feedback Vertex Sets in Tournaments (Q4908824) (← links)
- 2-Approximating Feedback Vertex Set in Tournaments (Q5146832) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5918432) (← links)
- A tight approximation algorithm for the cluster vertex deletion problem (Q5925651) (← links)
- A \(7 / 3\)-approximation algorithm for feedback vertex set in tournaments via Sherali-Adams (Q6162034) (← links)
- Quick-sort style approximation algorithms for generalizations of feedback vertex set in tournaments (Q6547935) (← links)
