scientific article; zbMATH DE number 3735154

MaRDI QIDQ3922181zbMATH OpenFDO

Authors Michal Z. Servit

Publication date 1981

zbMATH Keywords

printed circuit board

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Graph theory (including graph drawing) in computer science (68R10) Circuits, networks (94C99)

Cited in

(8)

• Two probabilistic results on rectilinear Steiner trees
• Fast heuristic algorithms for rectilinear Steiner trees
• A heuristic for Euclidean and rectilinear Steiner problems
• Steiner's problem in graphs: Heuristic methods
• Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study
• The Steiner tree problem in orientation metrics
• Minimum rectilinear Steiner tree of n points in the unit square
• A probably fast, provably optimal algorithm for rectilinear Steiner trees

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 Q3922181)