scientific article; zbMATH DE number 1424547
From MaRDI portal
zbMATH Open0968.90067MaRDI QIDQ4945796FDOQ4945796
Authors: David M. Warme, Pawel Winter, Martin Zachariasen 
Publication date: 7 June 2000
Title of this publication is not available (Why is that?)
Recommendations
Programming involving graphs or networks (90C35) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Graph algorithms (graph-theoretic aspects) (05C85) Combinatorial optimization (90C27) Nonnumerical algorithms (68W05)
Cited In (43)
- Solving rectilinear Steiner tree problems exactly in theory and practice
- An initial study of budgeted Steiner networks
- Optimal Steiner hull algorithm
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space
- Computing Euclidean Steiner trees over segments
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension
- Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions
- Solving the prize‐collecting Euclidean Steiner tree problem
- Improved computation of plane Steiner minimal trees
- Delay-related secondary objectives for rectilinear Steiner minimum trees.
- New pruning rules for the Steiner tree problem and 2-connected Steiner network problem
- A geometric characterisation of the quadratic min-power centre
- Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees
- Title not available (Why is that?)
- Title not available (Why is that?)
- Simplifying obstacles for Steiner network problems in the plane
- Minimum cost flow‐dependent communication networks
- A robust and scalable algorithm for the Steiner problem in graphs
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space
- Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm
- Approaches to the Steiner Problem in Networks
- Geometry-experiment algorithm for Steiner minimal tree problem
- Splitting trees at vertices
- An algorithm for the steiner problem in the euclidean plane
- Improved algorithms for the Steiner problem in networks
- On the structure and complexity of the 2-connected Steiner network problem in the plane
- A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$
- Short trees in polygons
- A catalog of Hanan grid problems
- A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space
- Generalised \(k\)-Steiner tree problems in normed planes
- Title not available (Why is that?)
- Bounding component sizes of two-connected Steiner networks
- Worst-case ratios of networks in the rectilinear plane
- Computing minimum 2-edge-connected Steiner networks in the Euclidean plane
- Exact algorithms for the bottleneck Steiner tree problem
- Computing skeletons for rectilinearly convex obstacles in the rectilinear plane
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study
- A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\)
- SCIP-Jack -- a solver for STP and variants with parallelization extensions
- A PSO-based timing-driven octilinear Steiner tree algorithm for VLSI routing considering bend reduction
- Exact computation of Steiner minimal trees in the plane
- On Steiner trees and minimum spanning trees in hypergraphs
Uses Software
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 Q4945796)
