Pages that link to "Item:Q4606339"
From MaRDI portal
The following pages link to A 7/3-Approximation for Feedback Vertex Sets in Tournaments (Q4606339):
Displaying 11 items.
- Improved approximation algorithms for hitting 3-vertex paths (Q2191773) (← links)
- Ranking tournaments with no errors. I: Structural description (Q2284746) (← links)
- Tournaments and Semicomplete Digraphs (Q3120434) (← links)
- Improved bounds for minimal feedback vertex sets in tournaments (Q4581278) (← links)
- Sub-Exponential Time Parameterized Algorithms for Graph Layout Problems on Digraphs with Bounded Independence Number (Q5090975) (← links)
- Triangle packing in (sparse) tournaments: approximation and kernelization (Q5111699) (← 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)
- Sub-exponential time parameterized algorithms for graph layout problems on digraphs with bounded independence number (Q6107892) (← 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)