scientific article; zbMATH DE number 1424547
From MaRDI portal
Publication:4945796
zbMath0968.90067MaRDI QIDQ4945796
David M. Warme, Pawel Winter, Martin Zachariasen
Publication date: 7 June 2000
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Programming involving graphs or networks (90C35) Nonnumerical algorithms (68W05) Polyhedral combinatorics, branch-and-bound, branch-and-cut (90C57) Combinatorial optimization (90C27) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items (37)
A geometric characterisation of the quadratic min-power centre ⋮ New pruning rules for the Steiner tree problem and 2-connected Steiner network problem ⋮ Geometry-experiment algorithm for Steiner minimal tree problem ⋮ Short trees in polygons ⋮ Bounding component sizes of two-connected Steiner networks ⋮ A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space ⋮ A robust and scalable algorithm for the Steiner problem in graphs ⋮ Splitting trees at vertices ⋮ Solving the prize‐collecting Euclidean Steiner tree problem ⋮ A new second‐order conic optimization model for the Euclidean Steiner tree problem in Rd$\mathbb {R}^d$ ⋮ Simplifying obstacles for Steiner network problems in the plane ⋮ A new heuristic for the Euclidean Steiner tree problem in \(\mathbb{R}^n\) ⋮ Dijkstra meets Steiner: a fast exact goal-oriented Steiner tree algorithm ⋮ 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 ⋮ Unnamed Item ⋮ Exact algorithms for the bottleneck Steiner tree problem ⋮ Delay-related secondary objectives for rectilinear Steiner minimum trees. ⋮ Computing Euclidean Steiner trees over segments ⋮ Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane ⋮ On the structure and complexity of the 2-connected Steiner network problem in the plane ⋮ The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study ⋮ Speeding up the Dreyfus-Wagner algorithm for minimum Steiner trees ⋮ Unnamed Item ⋮ An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space ⋮ A catalog of Hanan grid problems ⋮ Generalised \(k\)-Steiner tree problems in normed planes ⋮ Worst-case ratios of networks in the rectilinear plane ⋮ Improved algorithms for the Steiner problem in networks ⋮ Approaches to the Steiner Problem in Networks ⋮ Insight into the computation of Steiner minimal trees in Euclidean space of general dimension ⋮ Minimum cost flow‐dependent communication networks ⋮ Computing skeletons for rectilinearly convex obstacles in the rectilinear plane ⋮ Speeding up dynamic programming with representative sets: an experimental evaluation of algorithms for Steiner Tree on tree decompositions ⋮ Optimal Steiner hull algorithm ⋮ A sausage heuristic for Steiner minimal trees in three-dimensional Euclidean space ⋮ On Steiner trees and minimum spanning trees in hypergraphs
Uses Software
This page was built for publication:
