Primal-dual approximation algorithms for feedback problems in planar graphs (Q4645920): Difference between revisions

From MaRDI portal
Added link to MaRDI item.
ReferenceBot (talk | contribs)
Changed an Item
 
(3 intermediate revisions by 3 users not shown)
Property / MaRDI profile type
 
Property / MaRDI profile type: MaRDI publication profile / rank
 
Normal rank
Property / full work available at URL
 
Property / full work available at URL: https://doi.org/10.1007/3-540-61310-2_12 / rank
 
Normal rank
Property / OpenAlex ID
 
Property / OpenAlex ID: W2091757422 / rank
 
Normal rank
Property / cites work
 
Property / cites work: When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks / rank
 
Normal rank
Property / cites work
 
Property / cites work: Maximum induced forests of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3128894 / rank
 
Normal rank
Property / cites work
 
Property / cites work: On acyclic colorings of planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating minimum feedback sets and multicuts in directed graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximating Minimum Subset Feedback Sets in Undirected Graphs with Applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Primal-dual approximation algorithms for integral flow and multicut in trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximate max-flow min-(multi)cut theorems and their applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: A General Approximation Technique for Constrained Forest Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002852 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4857375 / rank
 
Normal rank
Property / cites work
 
Property / cites work: An approximate max-flow min-cut relation for undirected multicommodity flow, with applications / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4234131 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Vertex packings: Structural properties and algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Packing directed circuits fractionally / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4028105 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A primal-dual approximation algorithm for generalized Steiner network problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-and edge-deletion NP-complete problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Constant ratio approximations of the weighted feedback vertex set problem for undirected graphs / rank
 
Normal rank

Latest revision as of 11:01, 4 December 2024

scientific article; zbMATH DE number 7000346
Language Label Description Also known as
English
Primal-dual approximation algorithms for feedback problems in planar graphs
scientific article; zbMATH DE number 7000346

    Statements

    Primal-dual approximation algorithms for feedback problems in planar graphs (English)
    0 references
    0 references
    0 references
    11 January 2019
    0 references
    approximation algorithm
    0 references
    planar graph
    0 references
    undirected graph
    0 references
    network design problem
    0 references
    linear programming relaxation
    0 references

    Identifiers