Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
From MaRDI portal
Recommendations
- Parameterized approximation algorithms for bidirected Steiner network problems
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- Tight bounds for planar strongly connected Steiner subgraph with fixed number of terminals (and extensions)
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
Cited in
(13)- scientific article; zbMATH DE number 1305468 (Why is no real title available?)
- Parameterized Complexity of Directed Steiner Network with Respect to Shared Vertices and Arcs
- An ETH-tight algorithm for bidirected Steiner connectivity
- The parameterized complexity of the survivable network design problem
- On the exact \& approximate complexity of the strongly connected Steiner subgraph problem on two terminals with demands
- Parameterized algorithms for Steiner forest in bounded width graphs
- Finding smallest witnesses for conjunctive queries
- Parameterized algorithms for \textsc{Steiner Forest} in bounded width graphs
- On equivalence of parameterized inapproximability of k-median, k-max-coverage, and 2-CSP
- On equivalence of parameterized inapproximability of \(k\)-median, \(k\)-max-coverage, and 2-CSP
- Can you link up with treewidth?
- Multicut problems in embedded graphs: the dependency of complexity on the demand pattern
- Can you link up with treewidth?
This page was built for publication: Parameterized Approximation Algorithms for Bidirected Steiner Network Problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5032020)
