Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (Q5270408): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
Property / cites work
 
Property / cites work: Fixed parameter algorithms for DOMINATING SET and related problems on planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Linear time algorithms for finding a dominating set of fixed size in degenerated graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner problem with edge lengths 1 and 2 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Proof of a conjecture of Mader, Erdős and Hajnal on topological complete subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation hardness of dominating set problems in bounded degree graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / 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: Subexponential parameterized algorithms on bounded-genus graphs and <i>H</i> -minor-free graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Node-Weighted Steiner Tree and Group Steiner Tree in Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fundamentals of parameterized complexity / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4526990 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Diameter and treewidth in minor-closed graph families / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parametrized complexity theory. / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Single-Exponential Time Polynomial Space Algorithm for Steiner Tree / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dominating Sets in Planar Graphs: Branch-Width and Exponential Speed-Up / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming for minimum Steiner trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4198056 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Local tree-width, excluded minors, and approximation algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Structure Theorem and Isomorphism Test for Graphs with Excluded Topological Subgraphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation algorithms for connected dominating sets / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Arc-Weighted Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Integrality Ratio for Group Steiner Trees and Directed Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Which problems have strongly exponential complexity? / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Complexity of Directed Steiner Tree on Sparse Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4764186 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees / rank
 
Normal rank
Property / cites work
 
Property / cites work: Topological cliques in graphs II / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3210200 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3002818 / rank
 
Normal rank
Property / cites work
 
Property / cites work: FPT algorithms for connected feedback vertex set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Enumerate and expand: Improved algorithms for connected vertex cover and tree cover / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5710169 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Polynomial kernels for dominating set in graphs of bounded degeneracy and beyond / rank
 
Normal rank
Property / cites work
 
Property / cites work: Subexponential-Time Parameterized Algorithm for Steiner Tree on Planar Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Network Sparsification for Steiner Problems on Planar and Bounded-Genus Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5689037 / rank
 
Normal rank
Property / cites work
 
Property / cites work: A series of approximation algorithms for the acyclic directed Steiner tree problem / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4828915 / rank
 
Normal rank

Revision as of 00:11, 14 July 2024

scientific article; zbMATH DE number 6734950
Language Label Description Also known as
English
Parameterized Complexity of Directed Steiner Tree on Sparse Graphs
scientific article; zbMATH DE number 6734950

    Statements

    Parameterized Complexity of Directed Steiner Tree on Sparse Graphs (English)
    0 references
    23 June 2017
    0 references
    algorithms and data structures
    0 references
    graph algorithms
    0 references
    parameterized algorithms
    0 references
    Steiner tree problem
    0 references
    sparse graph classes
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references

    Identifiers

    0 references
    0 references
    0 references
    0 references
    0 references