The complexity landscape of fixed-parameter directed Steiner network problems
From MaRDI portal
Cites work
- A Nearly Best-Possible Approximation Algorithm for Node-Weighted Steiner Trees
- A Polynomial-Time Approximation Scheme for Euclidean Steiner Forest
- A series of approximation algorithms for the acyclic directed Steiner tree problem
- A Tight Algorithm for Strongly Connected Steiner Subgraph on Two Terminals with Demands (Extended Abstract)
- An O(n n) approximation scheme for Steiner tree in planar graphs
- Approximation Algorithms for Directed Steiner Problems
- Approximation algorithms for node-weighted buy-at-bulk network design
- Approximation Schemes for Steiner Forest on Planar Graphs and Graphs of Bounded Treewidth
- Complexity of the Steiner Network Problem with Respect to the Number of Terminals
- Dynamic programming for minimum Steiner trees
- Euclidean prize-collecting Steiner forest
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Fundamentals of parameterized complexity
- scientific article; zbMATH DE number 1305468 (Why is no real title available?)
- scientific article; zbMATH DE number 4121424 (Why is no real title available?)
- scientific article; zbMATH DE number 2203240 (Why is no real title available?)
- Improved approximation algorithms for (budgeted) node-weighted Steiner problems
- Improved approximation algorithms for prize-collecting Steiner tree and TSP
- Node-weighted Steiner tree and group Steiner tree in planar graphs
- On directed Steiner trees with multiple roots
- On the parameterized complexity of multiple-interval graph problems
- On tree width, bramble size, and expansion
- Parameterized algorithms
- Parameterized approximation algorithms for bidirected Steiner network problems
- Parameterized complexity of arc-weighted directed Steiner problems
- Parametrized complexity theory.
- Reducibility among combinatorial problems
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- Steiner tree approximation via iterative randomized rounding
- The complexity landscape of fixed-parameter directed Steiner network problems
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- The steiner problem in graphs
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- Tighter Bounds for Graph Steiner Tree Approximation
- When Trees Collide: An Approximation Algorithm for the Generalized Steiner Problem on Networks
This page was built for publication: The complexity landscape of fixed-parameter directed Steiner network problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7022856)
