Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in Rd

DOI10.1002/net.3230240303zbMath0801.90117OpenAlexW2070582626MaRDI QIDQ4291488

Konstantinos Kalpakis, Alan T. Sherman

Publication date: 10 May 1994

Published in: Networks (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1002/net.3230240303

zbMATH Keywords

geometric Steiner minimum treemultilayer VLSI routing

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Abstract computational complexity for mathematical programming problems (90C60)

Related Items (2)

Smoothed analysis of partitioning algorithms for Euclidean functionals ⋮ Iterated local search algorithms for the Euclidean Steiner tree problem inndimensions

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• On the Problem of Steiner
• Convexity and the Steiner tree problem

This page was built for publication: Probabilistic analysis of an enhanced partitioning algorithm for the steiner tree problem in R^d