The following pages link to The Steiner tree problem (Q1202044):
Displaying 50 items.
- An estimate of the objective function optimum for the network Steiner problem (Q271950) (← links)
- Gradient-constrained discounted Steiner trees. I: Optimal tree configurations (Q280980) (← links)
- Steiner tree problem with minimum number of Steiner points and bounded edge-length (Q294609) (← links)
- Maximising the worth of nascent networks (Q301061) (← links)
- A specialized branch-and-bound algorithm for the Euclidean Steiner tree problem in \(n\)-space (Q316167) (← links)
- Enhanced compact models for the connected subgraph problem and for the shortest path problem in digraphs with negative cycles (Q336550) (← links)
- On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree (Q344954) (← links)
- Risk models for the prize collecting Steiner tree problems with interval data (Q403434) (← links)
- Steiner tree reoptimization in graphs with sharpened triangle inequality (Q414457) (← links)
- The minimum spanning tree problem with conflict constraints and its variations (Q429679) (← links)
- On segmenting logistical zones for servicing continuously developed consumers (Q462009) (← links)
- On the core and nucleolus of directed acyclic graph games (Q526836) (← links)
- Sweeping points (Q548657) (← links)
- Tree network design avoiding congestion (Q646180) (← links)
- New geometry-inspired relaxations and algorithms for the metric Steiner tree problem (Q647390) (← links)
- A series of approximation algorithms for the acyclic directed Steiner tree problem (Q679453) (← links)
- The full Steiner tree problem (Q702772) (← links)
- New formulations for the hop-constrained minimum spanning tree problem via Sherali and Driscoll's tightened Miller-Tucker-Zemlin constraints (Q709141) (← links)
- Planar bus graphs (Q724233) (← links)
- The Steiner problem on surfaces of revolution (Q742573) (← links)
- Upper and lower bounding strategies for the generalized minimum spanning tree problem (Q817552) (← links)
- On the terminal connection problem (Q831820) (← links)
- A better constant-factor approximation for selected-internal Steiner minimum tree (Q848949) (← links)
- Locally minimal uniformly oriented shortest networks (Q858304) (← links)
- On reductions for the Steiner problem in graphs (Q876697) (← links)
- An improved approximation algorithm for the partial-terminal Steiner tree problem with edge cost 1 or 2 (Q891823) (← links)
- Flip distance between triangulations of a simple polygon is NP-complete (Q894685) (← links)
- Steiner's invariants and minimal connections (Q931849) (← links)
- The neglected pillar of material computation (Q933423) (← links)
- A tabu search heuristic for the generalized minimum spanning tree problem (Q933503) (← links)
- Heuristics for automated knowledge source integration and service composition (Q941554) (← links)
- An improved algorithm for computing Steiner minimal trees in Euclidean \(d\)-space (Q951125) (← links)
- The Fermat star of binary trees (Q987825) (← links)
- Quasi-median hulls in Hamming space are Steiner hulls (Q1003664) (← links)
- Combinatorial optimization in system configuration design (Q1027725) (← links)
- On approximation algorithms for the terminal Steiner tree problem (Q1029037) (← links)
- Steiner trees for fixed orientation metrics (Q1029671) (← links)
- Steiner intervals, geodesic intervals, and betweenness (Q1045107) (← links)
- Exploring the constrained maximum edge-weight connected graph problem (Q1048254) (← links)
- A primer of the Euclidean Steiner problem (Q1179729) (← links)
- Weighted connected domination and Steiner trees in distance-hereditary graphs (Q1270785) (← links)
- Minimal binary trees with a regular boundary: The case of skeletons with five endpoints (Q1274069) (← links)
- Approximations for subset interconnection designs (Q1274995) (← links)
- Computing optimal rectilinear Steiner trees: A survey and experimental evaluation (Q1276966) (← links)
- Class Steiner trees and VLSI-design (Q1276969) (← links)
- The partial sum criterion for Steiner trees in graphs and shortest paths (Q1278596) (← links)
- On the approximability of the Steiner tree problem in phylogeny (Q1281766) (← links)
- Minimal connected enclosures on an embedded planar graph (Q1283782) (← links)
- Neural and delay based heuristics for the Steiner problem in networks (Q1296029) (← links)
- Steiner polygons in the Steiner problem (Q1337104) (← links)
