Pages that link to "Item:Q4182533"
From MaRDI portal
The following pages link to The Complexity of Computing Steiner Minimal Trees (Q4182533):
Displayed 50 items.
- On the restricted 1-Steiner tree problem (Q2019490) (← links)
- On approximations for constructing 1-line minimum rectilinear Steiner trees in the Euclidean plane \(\mathbb{R}^2\) (Q2039643) (← links)
- Insight into the computation of Steiner minimal trees in Euclidean space of general dimension (Q2064280) (← links)
- \(1\)-line minimum rectilinear Steiner trees and related problems (Q2084647) (← links)
- On the restricted \(k\)-Steiner tree problem (Q2084651) (← links)
- Approximation algorithms for solving the line-capacitated minimum Steiner tree problem (Q2089871) (← links)
- Mixed integer nonlinear optimization models for the Euclidean Steiner tree problem in \(\mathbb{R}^d\) (Q2131142) (← links)
- On a nonconvex MINLP formulation of the Euclidean Steiner tree problem in \(n\)-space: missing proofs (Q2174883) (← links)
- The Steiner tree in \(K_{1,r}\)-free split graphs -- a dichotomy (Q2181262) (← links)
- Geometric multicut: shortest fences for separating groups of objects in the plane (Q2207588) (← links)
- Computational complexity of the 2-connected Steiner network problem in the \(\ell_p\) plane (Q2216434) (← links)
- On the history of the Euclidean Steiner tree problem (Q2249438) (← links)
- Bottleneck Steiner tree with bounded number of Steiner vertices (Q2253907) (← links)
- Breakout local search for the Steiner tree problem with revenue, budget and hop constraints (Q2255904) (← links)
- The Euclidean bottleneck full Steiner tree problem (Q2258077) (← links)
- Probabilistic properties of topologies of minimal fillings of finite metric spaces (Q2259306) (← links)
- Variable neighbourhood search for the minimum labelling Steiner tree problem (Q2267296) (← links)
- A near linear time approximation scheme for Steiner tree among obstacles in the plane (Q2269141) (← links)
- Approximation algorithms for solving the 1-line Euclidean minimum Steiner tree problem (Q2292156) (← links)
- Isoperimetric enclosures (Q2345509) (← links)
- Monochromatic geometric \(k\)-factors for bicolored point sets with auxiliary points (Q2350591) (← links)
- Reducing the diameter of a unit disk graph via node addition (Q2353655) (← links)
- On the clustered Steiner tree problem (Q2355992) (← links)
- A Newton's method for perturbed second-order cone programs (Q2385540) (← links)
- Upper and lower bounds for the lengths of Steiner trees in 3-space (Q2387794) (← links)
- Approximation schemes for node-weighted geometric Steiner tree problems (Q2391178) (← links)
- Approximate Euclidean Steiner trees (Q2397467) (← links)
- Approximations for two variants of the Steiner tree problem in the Euclidean plane \(\mathbb R^2\) (Q2434638) (← links)
- Euclidean Steiner trees optimal with respect to swapping 4-point subtrees (Q2448203) (← links)
- Complexity of Steiner Tree in Split Graphs - Dichotomy Results (Q2795958) (← links)
- An Algorithm to Find the Link Constrained Steiner Tree in Undirected Graphs (Q2819269) (← links)
- An overview of exact algorithms for the Euclidean Steiner tree problem in<i>n</i>-space (Q2827758) (← links)
- Iterated local search algorithms for the Euclidean Steiner tree problem in<i>n</i>dimensions (Q2829166) (← links)
- On the Clustered Steiner Tree Problem (Q2867108) (← links)
- THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916) (← links)
- ON CHARACTERISTIC AREA OF STEINER TREE (Q3007766) (← links)
- Using structured steiner trees for hierarchical global routing (Q3348418) (← links)
- Dynamic Programming Driven Memetic Search for the Steiner Tree Problem with Revenues, Budget, and Hop Constraints (Q3466769) (← links)
- (1 + ρ)-Approximation for Selected-Internal Steiner Minimum Tree (Q3511368) (← links)
- Steiner Minimal Trees on Zig-Zag Lines (Q3673573) (← links)
- Steiner Minimal Tree for Points on a Circle (Q3728014) (← links)
- (Q3907583) (← links)
- The 1-Steiner-Minimal-Tree problem in Minkowski-spaces (Q3978585) (← links)
- Determining shortest networks in the Euclidean plane (Q4299277) (← links)
- The local Steiner problem in normed planes (Q4519132) (← links)
- Growing Half-Balls: Minimizing Storage and Communication Costs in Content Delivery Networks (Q4578010) (← links)
- A Lagrangean-based decomposition approach for the link constrained Steiner tree problem (Q4637834) (← links)
- The computation of nearly minimal Steiner trees in graphs (Q4750659) (← links)
- Models and branch‐and‐cut algorithms for the Steiner tree problem with revenues, budget and hop constraints (Q5191136) (← links)
- Reorganizing topologies of Steiner trees to accelerate their eliminations (Q5216441) (← links)