The following pages link to Martin Zachariasen (Q1402522):
Displaying 33 items.
- (Q1029670) (redirect page) (← links)
- Steiner trees for fixed orientation metrics (Q1029671) (← links)
- Guided local search for final placement in VLSI design (Q1402523) (← links)
- Rectilinear group Steiner trees and applications in VLSI design (Q1411625) (← links)
- Delay-related secondary objectives for rectilinear Steiner minimum trees. (Q1427185) (← links)
- New pruning rules for the Steiner tree problem and 2-connected Steiner network problem (Q1631775) (← links)
- The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study (Q1741111) (← links)
- Local search for the Steiner tree problem in the Euclidean plane (Q1806730) (← links)
- On the location of Steiner points in uniformly-oriented Steiner trees. (Q1853076) (← links)
- Rotationally optimal spanning and Steiner trees in uniform orientation metrics (Q1886240) (← links)
- Concatenation-based greedy heuristics for the Euclidean Steiner tree problem (Q1961044) (← links)
- On the history of the Euclidean Steiner tree problem (Q2249438) (← links)
- Optimal interconnection trees in the plane. Theory, algorithms and applications (Q2339762) (← links)
- Two-connected Steiner networks: structural properties (Q2488236) (← links)
- Canonical forms and algorithms for Steiner trees in uniform orientation metrics (Q2498405) (← links)
- A catalog of Hanan grid problems (Q2748382) (← links)
- Guided Local Search for the Three-Dimensional Bin-Packing Problem (Q2884559) (← links)
- (Q2934673) (← links)
- THE UNIFORM ORIENTATION STEINER TREE PROBLEM IS NP-HARD (Q2939916) (← links)
- Divisor-Based Biproportional Apportionment in Electoral Systems: A Real-Life Benchmark Study (Q3117272) (← links)
- Flexibility of Steiner trees in uniform orientation metrics (Q3367055) (← links)
- Fast and Compact Oracles for Approximate Distances in Planar Graphs (Q3527255) (← links)
- (Q4242783) (← links)
- (Q4252440) (← links)
- (Q4350076) (← links)
- Euclidean Steiner minimum trees: An improved exact algorithm (Q4363408) (← links)
- (Q4411408) (← links)
- Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane (Q4628046) (← links)
- (Q4945796) (← links)
- A novel approach to phylogenetic trees: <i>d</i>‐Dimensional geometric Steiner trees (Q5191133) (← links)
- Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions (Q5269369) (← links)
- Algorithms – ESA 2004 (Q5464638) (← links)
- Algorithms and Computation (Q5712110) (← links)
