An approximation algorithm for the \(l\)-pseudoforest deletion problem (Q2285146): Difference between revisions

From MaRDI portal
Set OpenAlex properties.
Created claim: Wikidata QID (P12): Q127401893, #quickstatements; #temporary_batch_1723632976074
 
(One intermediate revision by one other user not shown)
Property / cites work
 
Property / cites work: A 2-Approximation Algorithm for the Undirected Feedback Vertex Set Problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3221758 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Optimization of Pearl's method of conditioning and greedy-like approximation algorithms for the vertex feedback set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A faster parameterized algorithm for pseudoforest deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: On feedback vertex set: new measure and new structures / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual interpretation of two 2-approximation algorithms for the feedback vertex set problem in undirected graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Solving Connectivity Problems Parameterized by Treewidth in Single Exponential Time / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dealing with several parameterized problems by random methods / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized algorithms for edge biclique and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization and randomized parameterized algorithms for co-path set problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: A note on approximation of the vertex cover and feedback vertex set problems -- Unified approach / rank
 
Normal rank
Property / cites work
 
Property / cites work: Faster deterministic \textsc{Feedback Vertex Set} / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved linear kernel for complementary maximal strip recovery: simpler and smaller / rank
 
Normal rank
Property / cites work
 
Property / cites work: Improved kernel results for some FPT problems based on simple observations / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved FPT algorithm for almost forest deletion problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Partition on trees with supply and demand: kernelization and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structural Parameterizations of Feedback Vertex Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Generalized Pseudoforest Deletion: Algorithms and Uniform Kernel / rank
 
Normal rank
Property / cites work
 
Property / cites work: Bivariate Complexity Analysis of Almost Forest Deletion / rank
 
Normal rank
Property / cites work
 
Property / cites work: A parameterized algorithm for the maximum agreement forest problem on multiple rooted multifurcating trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: An improved exact algorithm for undirected feedback vertex set / rank
 
Normal rank
Property / Wikidata QID
 
Property / Wikidata QID: Q127401893 / rank
 
Normal rank

Latest revision as of 12:07, 14 August 2024

scientific article
Language Label Description Also known as
English
An approximation algorithm for the \(l\)-pseudoforest deletion problem
scientific article

    Statements

    An approximation algorithm for the \(l\)-pseudoforest deletion problem (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    16 January 2020
    0 references
    approximation algorithm
    0 references
    \(l\)-pseudoforest deletion problem
    0 references
    local ratio
    0 references
    feedback vertex set problem
    0 references
    0 references

    Identifiers