Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (Q5857009): Difference between revisions

From MaRDI portal
Import240304020342 (talk | contribs)
Set profile property.
ReferenceBot (talk | contribs)
Changed an Item
 
(One intermediate revision by one other user not shown)
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: Fourier meets M\"{o}bius: fast subset convolution / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5009490 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Thek-Steiner Ratio in Graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: An <i>O</i> ( <i>n</i> log <i>n</i> ) approximation scheme for Steiner tree in planar graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Steiner Tree Approximation via Iterative Randomized Rounding / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Directed Steiner Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Fixed-Parameter and Approximation Algorithms: A New Look / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Approximation Algorithms for Bidirected Steiner Network Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q3046489 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Parameterized Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: Analytical approach to parallel repetition / rank
 
Normal rank
Property / cites work
 
Property / cites work: Kernelization Lower Bounds Through Colors and IDs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4503944 / rank
 
Normal rank
Property / cites work
 
Property / cites work: The steiner problem in graphs / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q5743426 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Q4598163 / rank
 
Normal rank
Property / cites work
 
Property / cites work: Dynamic programming for minimum Steiner trees / 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: Polylogarithmic inapproximability / rank
 
Normal rank
Property / cites work
 
Property / cites work: Approximation Algorithms for Steiner Tree Based on Star Contractions: A Unified View / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Steiner tree problem / 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: Reducibility among Combinatorial Problems / rank
 
Normal rank
Property / cites work
 
Property / cites work: Lossy kernelization / 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 Möbius Inversion: Improving on Steiner Tree and Related Problems / 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: On the Parameterized Complexity of Approximating Dominating Set / rank
 
Normal rank
Property / cites work
 
Property / cites work: Extending the kernel for planar Steiner tree to the number of Steiner vertices / rank
 
Normal rank
Property / cites work
 
Property / cites work: The Design of Approximation Algorithms / rank
 
Normal rank
Property / cites work
 
Property / cites work: An 11/6-approximation algorithm for the network Steiner problem / rank
 
Normal rank
links / mardi / namelinks / mardi / name
 

Latest revision as of 22:21, 24 July 2024

scientific article; zbMATH DE number 7329532
Language Label Description Also known as
English
Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices
scientific article; zbMATH DE number 7329532

    Statements

    Parameterized Approximation Schemes for Steiner Trees with Small Number of Steiner Vertices (English)
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    30 March 2021
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    Steiner tree
    0 references
    Steiner forest
    0 references
    approximation algorithms
    0 references
    parameterized algorithms
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references
    0 references