Parameterized algorithms for feedback set problems and their duals in tournaments
From MaRDI portal
Publication:820159
Recommendations
- Parameterized and Exact Computation
- A parameterized algorithm for subset feedback vertex set in tournaments
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
- Fixed-parameter tractability results for feedback set problems in tournaments
- Parameterized complexity of directed feedback set problems in tournaments.
- An approximation algorithm for feedback vertex sets in tournaments
- Improved approximation algorithm for the feedback set problem in a bipartite tournament
- Linear programming based approximation algorithms for feedback set problems in bipartite tournaments
- Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments
Cites work
- scientific article; zbMATH DE number 5158513 (Why is no real title available?)
- scientific article; zbMATH DE number 1979503 (Why is no real title available?)
- scientific article; zbMATH DE number 1498519 (Why is no real title available?)
- scientific article; zbMATH DE number 219267 (Why is no real title available?)
- scientific article; zbMATH DE number 3257176 (Why is no real title available?)
- scientific article; zbMATH DE number 3319308 (Why is no real title available?)
- A Polynomial Algorithm for Constructing a Large Bipartite Subgraph, with an Application to a Satisfiability Problem
- An efficient fixed-parameter algorithm for 3-hitting set
- Analogs & duals of the MAST problem for sequences & trees
- Approximating minimum feedback sets and multicuts in directed graphs
- Finding a Minimum Circuit in a Graph
- Girth in digraphs
- On the existence of subexponential parameterized algorithms
- Parameterized and Exact Computation
- Parameterized complexity of directed feedback set problems in tournaments.
- Parameterized complexity of finding subgraphs with hereditary properties.
- Parameterizing above Guaranteed Values: MaxSat and MaxCut
- Ranking Tournaments
Cited in
(38)- The solution space of sorting with recurring comparison faults
- Improved parameterized algorithms for the Kemeny aggregation problem
- Faster exact and parameterized algorithm for feedback vertex set in tournaments
- Maximum balanced subgraph problem parameterized above lower bound
- Parameterized complexity of the induced subgraph problem in directed graphs
- Breaking the \(2^{n}\)-barrier for irredundance: two lines of attack
- Parameterized algorithms for \(d\)-hitting set: the weighted case
- Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization
- Beyond Max-Cut: \(\lambda\)-extendible properties parameterized above the Poljak-Turzík bound
- \textsc{Max-Cut} parameterized above the Edwards-Erdős bound
- Parameterized Eulerian strong component arc deletion problem on tournaments
- Kernels for feedback arc set in tournaments
- A polynomial kernel for \textsc{Feedback Arc Set} on bipartite tournaments
- Fixed-parameter tractability results for feedback set problems in tournaments
- Packing arc-disjoint cycles in tournaments
- Parameterized complexity of directed feedback set problems in tournaments.
- Tournaments and Semicomplete Digraphs
- Improved fixed parameter tractable algorithms for two ``edge problems: MAXCUT and MAXDAG
- Optimal parallel construction of prescribed tournaments
- An updated survey on the linear ordering problem for weighted or unweighted tournaments
- Parameterized complexity of Eulerian deletion problems
- A quadratic vertex kernel for feedback arc set in bipartite tournaments
- Linear kernels and linear-time algorithms for finding large cuts
- Acyclic digraphs
- Linear kernel for \textsc{Rooted Triplet Inconsistency} and other problems based on conflict packing technique
- The solution space of sorting with recurring comparison faults
- Possible winner problems on partial tournaments: a parameterized study
- Parameterized and Exact Computation
- Parameterized complexity of Eulerian deletion problems
- Fixed-Parameter Tractability Results for Feedback Set Problems in Tournaments
- Algorithms and kernels for \textsc{Feedback Set} problems in generalizations of tournaments
- Fixed-parameter algorithms for cluster vertex deletion
- An exact exponential-time algorithm for the directed maximum leaf spanning tree problem
- Voting procedures, complexity of
- What's next? Future directions in parameterized complexity
- A survey on the linear ordering problem for weighted or unweighted tournaments
- Recurring comparison faults: sorting and finding the minimum
- Hardness of subgraph and supergraph problems in \(c\)-tournaments
This page was built for publication: Parameterized algorithms for feedback set problems and their duals in tournaments
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q820159)
