Fixed-parameter tractability results for feedback set problems in tournaments (Q2266940): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
ReferenceBot (talk | contribs)
Changed an Item
 
Property / cites work
 
Property / cites work: Kernelization Algorithms for d-Hitting Set Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernels: Annotated, Proper and Induced / rank
 
Normal rank
Property / cites work
 
Property / cites work: Aggregating inconsistent information / rank
 
Normal rank
Property / cites work
 
Property / cites work: Ranking Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast FAST / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4539516 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An Approximation Algorithm for Feedback Vertex Sets in Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Min-Max Theorem on Feedback Vertex Sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient algorithms for the maximum weight clique and maximum weight independent set problems on permutation graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Minimum Feedback Arc Set Problem is NP-Hard for Tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: A survey on the linear ordering problem for weighted or unweighted tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved Parameterized Upper Bounds for Vertex Cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved algorithms for feedback vertex set problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fixed-parameter algorithm for the directed feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: An \(\mathcal O(2^{O(k)}n^{3})\) FPT algorithm for the undirected feedback vertex set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: On the hardness of approximating minimum vertex cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4393480 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5715685 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A top-down approach to search-trees: Improved algorithmics for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3145802 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Compression and Exact Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Compression-based fixed-parameter algorithms for feedback vertex set and edge bipartization / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback arc set in bipartite tournaments is NP-complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Iterative Compression for Exactly Solving NP-Hard Minimization Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Feedback arc set problem in bipartite tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3600916 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter Algorithms for Cluster Vertex Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A fast algorithm for computing longest common subsequences / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3549601 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex cover might be hard to approximate to within \(2 - \varepsilon \) / rank
 
Normal rank
Property / cites work
 
Property / cites work: On maximal transitive subtournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An efficient fixed-parameter algorithm for 3-hitting set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for feedback set problems and their duals in tournaments / rank
 
Normal rank
Property / cites work
 
Property / cites work: Efficient exact algorithms through enumerating maximal independent sets and other techniques / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved FPT algorithm for feedback vertex set problem in bipartite tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved approximation algorithm for the feedback set problem in a bipartite tournament / rank
 
Normal rank
Property / cites work
 
Property / cites work: On enumerating all minimal solutions of feedback problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4694754 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Open problems around exact algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear Programming Based Approximation Algorithms for Feedback Set Problems in Bipartite Tournaments / rank
 
Normal rank

Latest revision as of 12:32, 2 July 2024

scientific article
Language Label Description Also known as
English
Fixed-parameter tractability results for feedback set problems in tournaments
scientific article

    Statements

    Fixed-parameter tractability results for feedback set problems in tournaments (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    26 February 2010
    0 references
    0 references
    0 references
    0 references
    0 references
    feedback arc set
    0 references
    feedback vertex set
    0 references
    tournament
    0 references
    bipartite tournament
    0 references
    fixed-parameter tractability
    0 references
    iterative compression
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references