A deep-submicron Steiner tree.

DOI10.1016/S0895-7177(00)00052-2zbMath1042.90629OpenAlexW2007959595MaRDI QIDQ1597158

Adil I. Erzin, Jun Dong Cho

Publication date: 5 May 2002

Published in: Mathematical and Computer Modelling (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0895-7177(00)00052-2

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Trees (05C05) Approximation algorithms (68W25)

Cites Work

• Unnamed Item
• The rectilinear Steiner arborescence problem
• Steiner problem in networks: A survey
• The Rectilinear Steiner Tree Problem is $NP$-Complete
• Thirty‐five‐point rectilinear steiner minimal trees in a day
• On Steiner’s Problem with Rectilinear Distance