The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
From MaRDI portal
Publication:3434998
Recommendations
- Directed Steiner problems with connectivity constraints
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- The complexity landscape of fixed-parameter directed Steiner network problems
- scientific article; zbMATH DE number 1303557
- Approximation Algorithms for Directed Steiner Problems
Cited in
(31)- On the edge capacitated Steiner tree problem
- Augmenting weighted graphs to establish directed point-to-point connectivity
- The Steiner connectivity problem
- Optimal data placement on networks with a constant number of clients
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)
- Locally Semicomplete Digraphs and Generalizations
- On directed Steiner trees with multiple roots
- Improved approximation algorithms for directed Steiner forest
- Classes of directed graded graphs with polynomially solvable cardinality Steiner problem
- The complexity landscape of fixed-parameter directed Steiner network problems
- Parameterized approximation algorithms for bidirected Steiner network problems
- Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals
- How to Secure Matchings Against Edge Failures
- How to Secure Matchings against Edge Failures
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- A tight algorithm for strongly connected Steiner subgraph on two terminals with demands
- How Many Steiner Terminals Can You Connect in 20 Years?
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
- scientific article; zbMATH DE number 7053371 (Why is no real title available?)
- Parameterized complexity of arc-weighted directed Steiner problems
- Parameterized certificate dispersal and its variants
- Node connectivity augmentation via iterative randomized rounding
- Solving Steiner trees: Recent advances, challenges, and perspectives
- An ETH-tight algorithm for bidirected Steiner connectivity
- Structural properties of minimum multi-source multi-sink Steiner networks in the Euclidean plane
- On the exact \& approximate complexity of the strongly connected Steiner subgraph problem on two terminals with demands
- Subexponential parameterized directed Steiner network problems on planar graphs: a complete classification
- The complexity landscape of fixed-parameter directed Steiner network problems
- Temporal connectivity augmentation
This page was built for publication: The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3434998)
