Directed Steiner problems with connectivity constraints
From MaRDI portal
Publication:1315992
Recommendations
- An approach for the Steiner problem in directed graphs
- Approximation Algorithms for Directed Steiner Problems
- scientific article; zbMATH DE number 1303557
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- Set connectivity problems in undirected graphs and the directed Steiner network problem
- The complexity landscape of fixed-parameter directed Steiner network problems
- The Steiner connectivity problem
- A constrained Steiner tree problem
- Steiner tree problems
- Steiner tree problems
Cites work
- scientific article; zbMATH DE number 3862931 (Why is no real title available?)
- scientific article; zbMATH DE number 4010182 (Why is no real title available?)
- scientific article; zbMATH DE number 4089320 (Why is no real title available?)
- scientific article; zbMATH DE number 3661345 (Why is no real title available?)
- scientific article; zbMATH DE number 3742993 (Why is no real title available?)
- scientific article; zbMATH DE number 193993 (Why is no real title available?)
- A dual ascent approach for steiner tree problems on a directed graph
- A quick method for finding shortest pairs of disjoint paths
- Computational Results with a Cutting Plane Algorithm for Designing Communication Networks with Low-Connectivity Constraints
- Disjoint paths in a network
- Facets for Polyhedra Arising in the Design of Communication Networks with Low-Connectivity Constraints
- Geometric algorithms and combinatorial optimization
- Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
- Maximizing Submodular Set Functions: Formulations and Analysis of Algorithms
- Minimum-weight two-connected spanning networks
- On the 0,1 facets of the set covering polytope
- On the facial structure of the set covering polytope
- On the set covering polytope. I: All the facets with coefficients in \(\{\) 0,1,2\(\}\)
- Optimum branchings
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
Cited in
(18)- The Steiner connectivity problem
- Optimal connection problem of single source multiple sinks on directed networks
- The Minimum Weight In-Tree Cover Problem
- Two variations of the minimum Steiner problem
- STEINER-diagrams
- Multicommodity disconnecting set problem
- Lehman's theorem and the directed Steiner tree problem
- On directed Steiner trees with multiple roots
- Steiner diagrams and \(k\)-star hubs
- scientific article; zbMATH DE number 2230205 (Why is no real title available?)
- Capacity-preserving subgraphs of directed flow networks
- Steiner problems on directed acyclic graphs
- Classes of directed graded graphs with polynomially solvable cardinality Steiner problem
- Rooted \(k\)-connections in digraphs
- scientific article; zbMATH DE number 1532673 (Why is no real title available?)
- The line connectivity problem
- The Directed Steiner Network Problem is Tractable for a Constant Number of Terminals
- An approach for the Steiner problem in directed graphs
This page was built for publication: Directed Steiner problems with connectivity constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1315992)
