The steiner problem in graphs
From MaRDI portal
Cites work
Cited in
(only showing first 100 items - show all)- Non-cooperative tree creation
- Vertex and edge covers with clustering properties: Complexity and algorithms
- Multiple hypernode hitting sets and smallest two-cores with targets
- Steiner problem in Halin networks
- Proving phylogenetic trees minimal with l-clustering and set partitioning
- Polynomially solvable special cases of the Steiner problem in planar networks
- The role of Steiner hulls in the solution to Steiner tree problems
- Two new criteria for finding Steiner hulls in Steiner tree problems
- Path-distance heuristic for the Steiner problem in undirected networks
- The point-to-point delivery and connection problems: Complexity and algorithms
- Steiner trees with n terminals among n+1 nodes
- Heuristics for the Steiner problem in graphs
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation
- Minimal connected enclosures on an embedded planar graph
- Neural and delay based heuristics for the Steiner problem in networks
- Tree polytope on 2-trees
- A primal-dual approximation algorithm for the Steiner forest problem
- The Steiner tree problem. I: Formulations, compositions and extensions and extension of facets
- The point-to-point connection problem - analysis and algorithms
- The dynamic predicate stashing copy problem and the Steiner problem in graphs
- Greedy can beat pure dynamic programming
- Parameterized approximation via fidelity preserving transformations
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Parameterized complexity of team formation in social networks
- A dynamic programming approach for the pipe network layout problem
- Binary Steiner trees: structural results and an exact solution approach
- Two variations of the minimum Steiner problem
- Steiner's problem in double trees
- The Turing way to parameterized complexity
- The propagation of updates to relational tables in a distributed database system
- Packing Steiner trees: A cutting plane algorithm and computational results
- Improved Steiner tree algorithms for bounded treewidth
- Faster algorithm for optimum Steiner trees
- Fast polynomial-space algorithms using inclusion-exclusion. Improving on Steiner tree and related problems
- Smoothed analysis of partitioning algorithms for Euclidean functionals
- Connected facility location via random facility sampling and core detouring
- Topological indices based on 2- or 3-eccentricity to predict anti-HIV activity
- Revising Johnson's table for the 21st century
- Tight bounds on subexponential time approximation of set cover and related problems
- Parameterized complexity of reconfiguration of atoms
- Steiner tree in \(k\)-star caterpillar convex bipartite graphs: a dichotomy
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy
- Robust reoptimization of Steiner trees
- On the edge capacitated Steiner tree problem
- Parameterized complexity of spare capacity allocation and the multicost Steiner subgraph problem
- Algorithmic aspects of Steiner convexity and enumeration of Steiner trees
- Complexity of independency and cliquy trees
- A multivariate analysis of the strict terminal connection problem
- On approximate preprocessing for domination and hitting subgraphs with connected deletion sets
- Approximability of minimum certificate dispersal with tree structures
- Augmenting weighted graphs to establish directed point-to-point connectivity
- Computing optimal Steiner trees in polynomial space
- Extending the kernel for planar Steiner tree to the number of Steiner vertices
- Parameterized complexity of secluded connectivity problems
- The homogeneous broadcast problem in narrow and wide strips. I: Algorithms
- Network design with a discrete set of traffic matrices
- The number of tree stars is \(O^{*}(1.357^k)\)
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
- FPT and kernelization algorithms for the induced tree problem
- Parameterized study of Steiner tree on unit disk graphs
- Combination algorithms for Steiner tree variants
- Complexity of Steiner tree in split graphs -- dichotomy results
- Parameterized complexity of team formation in social networks
- Generating all the Steiner trees and computing Steiner intervals for a fixed number of terminals
- Approximating subdense instances of covering problems
- Minimum certificate dispersal with tree structures
- Improved approximations for hard optimization problems via problem instance classification
- The min-power multicast problems in wireless ad hoc networks: a parameterized view
- Knowing all optimal solutions does not help for TSP reoptimization
- A layered graph model and an adaptive layers framework to solve delay-constrained minimum tree problems
- On directed Steiner trees with multiple roots
- Parameterized approximation schemes for Steiner trees with small number of Steiner vertices
- A dual ascent approach for steiner tree problems on a directed graph
- Using structured steiner trees for hierarchical global routing
- The number of tree stars is O*(1.357k)
- Parameterized single-exponential time polynomial space algorithm for Steiner tree
- Steiner trees with bounded RC-delay
- Directed Steiner trees with diffusion costs
- The influence of preprocessing on Steiner tree approximations
- Speeding up Dynamic Programming for Some NP-Hard Graph Recoloring Problems
- Reoptimization of Steiner Trees
- Fuzzy Replacement Analysis
- Faster Steiner Tree Computation in Polynomial-Space
- On finding steiner vertices
- The density maximization problem in graphs
- Parameterized complexity of Min-power multicast problems in wireless ad hoc networks
- scientific article; zbMATH DE number 3717342 (Why is no real title available?)
- On the approximability of dense Steiner problems
- A probably fast, provably optimal algorithm for rectilinear Steiner trees
- Covering Vectors by Spaces: Regular Matroids
- Parameterized single-exponential time polynomial space algorithm for Steiner tree
- Strong Steiner tree approximations in practice
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem
- The computation of nearly minimal Steiner trees in graphs
- The kernelization complexity of connected domination in graphs with (no) small cycles
- Strongly polynomial algorithm for two special minimum concave cost network flow problems
- An FPT algorithm in polynomial space for the directed Steiner tree problem with limited number of diffusing nodes
- A branch-and-price algorithm for switch-box routing
- Preprocessing for a map sectorization problem by means of mathematical programming
- Minimizing Rosenthal potential in multicast games
This page was built for publication: The steiner problem in graphs
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5636923)
