Probabilistic partitioning algorithms for the rectilinear steiner problem

DOI10.1002/net.3230150403zbMath0645.90096OpenAlexW1996164900MaRDI QIDQ3789373

János Komlós, Man-tak Shing

Publication date: 1985

Published in: Networks (Search for Journal in Brave)

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

zbMATH Keywords

approximate solutionundirected graphSteiner treepartitioning algorithmsrectilinear Steiner problem

Mathematics Subject Classification ID

Programming involving graphs or networks (90C35) Analysis of algorithms and problem complexity (68Q25) Inventory, storage, reservoirs (90B05)

Related Items (6)

Two probabilistic results on rectilinear Steiner trees ⋮ Fast heuristic algorithms for rectilinear Steiner trees ⋮ The Steiner tree problem in orientation metrics ⋮ A probably fast, provably optimal algorithm for rectilinear Steiner trees ⋮ Computing optimal rectilinear Steiner trees: A survey and experimental evaluation ⋮ Heuristics for the minimum rectilinear Steiner tree problem: New algorithms and a computational study

Cites Work

• Unnamed Item

This page was built for publication: Probabilistic partitioning algorithms for the rectilinear steiner problem