scientific article; zbMATH DE number 3677874

Cited in

(84)

Steiner problem in Halin networks
Worst-case performance of Rayward-Smith's Steiner tree heuristic
Fast heuristic algorithms for rectilinear Steiner trees
Branch-and-bound as a higher-order function
The multi-weighted Steiner tree problem
The role of Steiner hulls in the solution to Steiner tree problems
Path-distance heuristic for the Steiner problem in undirected networks
Heuristics for the Steiner problem in graphs
Steiner's problem in graphs: Heuristic methods
Class Steiner trees and VLSI-design
The Steiner problem in distributed computing systems
Worst-case performance of some heuristics for Steiner's problem in directed graphs
Comparison of formulations and a heuristic for packing Steiner trees in a graph
A data structure for bicategories, with application to speeding up an approximation algorithm
Distributed multicast routing in point-to-point networks
Solving group Steiner problems as Steiner problems.
Generalized spanning trees
A robust and scalable algorithm for the Steiner problem in graphs
A relax-and-cut framework for large-scale maximum weight connected subgraph problems
Gotta (efficiently) catch them all: Pokémon GO meets orienteering problems
A node-based layered graph approach for the Steiner tree problem with revenues, budget and hop-constraints
SCIP-Jack -- a solver for STP and variants with parallelization extensions
Decomposition methods for the two-stage stochastic Steiner tree problem
Binary Steiner trees: structural results and an exact solution approach
Solving minimum-cost shared arborescence problems
A faster approximation algorithm for the Steiner tree problem in graphs
Improved methods for approximating node weighted Steiner trees and connected dominating sets.
The generalized reserve set covering problem with connectivity and buffer requirements
Robust reoptimization of Steiner trees
Strategyproof auction mechanisms for network procurement
An improved algorithm for the Steiner tree problem with bounded edge-length
Distributed transactional memory for general networks
Minimizing maximum risk for fair network connection with interval data
The incremental connected facility location problem
A survey of combinatorial optimization problems in multicast routing
Viral systems: A new bio-inspired optimisation approach
Worst-case performance of Wong's Steiner tree heuristic
The rainbow Steiner tree problem
An Efficient Approximation Algorithm for the Steiner Tree Problem
Branch and Cut based on the volume algorithm: Steiner trees in graphs and Max-cut
On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree
The influence of preprocessing on Steiner tree approximations
Approximating the Generalized Capacitated Tree-Routing Problem
A super-stabilizing \(\log(n)\)-approximation algorithm for dynamic Steiner trees
On the low-dimensional Steiner minimum tree problem in Hamming metric
Exact and heuristic approaches for the maximum lifetime problem in sensor networks with coverage and connectivity constraints
Combining NP-hard reduction techniques and strong heuristics in an exact algorithm for the maximum-weight connected subgraph problem
Strong Steiner tree approximations in practice
The bursty Steiner tree problem
An improved decomposition-based heuristic to design a water distribution network for an irrigation system
A branch-and-price algorithm for switch-box routing
The Steiner tree problem with delays: a compact formulation and reduction procedures
Definition and algorithms for reliable Steiner tree problem
RNC-approximation algorithms for the steiner problem
A dual ascent-based branch-and-bound framework for the prize-collecting Steiner tree and related problems
scientific article; zbMATH DE number 2230204 (Why is no real title available?)
scientific article; zbMATH DE number 2230205 (Why is no real title available?)
Graph theory (algorithmic, algebraic, and metric problems)
scientific article; zbMATH DE number 7651143 (Why is no real title available?)
Modeling hop-constrained and diameter-constrained minimum spanning tree problems as Steiner tree problems over layered graphs
A faster approximation algorithm for the Steiner problem in graphs
A faster approximation algorithm for the Steiner problem in graphs
Implications, conflicts, and reductions for Steiner trees
Implications, conflicts, and reductions for Steiner trees
A note on distributed multicast routing in point-to-point networks
Intuitive solution-doubling techniques for worst-case analysis of some survivable network design problems
Heuristic algorithms for packing of multiple-group multicasting
Solving Steiner trees: Recent advances, challenges, and perspectives
Navigational guidance -- a deep learning approach
Ordered scheduling in control-flow distributed transactional memory
Dedicated protection of multicast sessions in mixed-graph sparse-splitting optical networks
NeuroPrim: an attention-based model for solving NP-hard spanning tree problems
An efficient solver for large-scale onshore wind farm siting including cable routing
Fully dynamic algorithms for Euclidean Steiner tree
Faster algorithms for Steiner tree and related problems: from theory to practice
A series of approximation algorithms for the acyclic directed Steiner tree problem
Survivable networks, linear programming relaxations and the parsimonious property
Non delayed relax-and-cut algorithms
Upper and lower bounding strategies for the generalized minimum spanning tree problem
A tabu search approach for solving a difficult forest harvesting machine location problem
The network design problem with relays
A factoring approach for the Steiner tree problem in undirected networks
A tabu search heuristic for the generalized minimum spanning tree problem
Mathematical methods for physical layout of printed circuit boards: an overview

This page was built for publication:

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3874241)