scientific article; zbMATH DE number 1163724
From MaRDI portal
Publication:4395337
zbMath0903.90175MaRDI QIDQ4395337
Publication date: 4 August 1998
Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.
integer programmingsubmodular functionbranch-and-cutSteiner treesrectilinear Steiner minimal treeconcatenation problemfull Steiner trees
Programming involving graphs or networks (90C35) Trees (05C05) Applications of mathematical programming (90C90) Integer programming (90C10) Communication networks in operations research (90B18) Hypergraphs (05C65) Combinatorial optimization (90C27)
Related Items (19)
Spanning trees in random regular uniform hypergraphs ⋮ Short trees in polygons ⋮ On the equivalence of the bidirected and hypergraphic relaxations for Steiner tree ⋮ Integrality gap of the hypergraphic relaxation of Steiner trees: A short proof of a 1.55 upper bound ⋮ Action of the symmetric groups on the homology of the hypertree posets ⋮ Minimizing path lengths in rectilinear Steiner minimum trees with fixed topology ⋮ Computing Euclidean Steiner trees over segments ⋮ Computing minimum 2‐edge‐connected Steiner networks in the Euclidean plane ⋮ Strong Steiner Tree Approximations in Practice ⋮ An ILP based hierarchical global routing approach for VLSI ASIC design ⋮ The GeoSteiner software package for computing Steiner trees in the plane: an updated computational study ⋮ On the history of the Euclidean Steiner tree problem ⋮ A partition-based relaxation for Steiner trees ⋮ Two-connected Steiner networks: structural properties ⋮ Bounding the expected number of rectilinear full Steiner trees ⋮ Approaches to the Steiner Problem in Networks ⋮ Efficient Prüfer-like coding and counting labelled hypertrees ⋮ Computing optimal rectilinear Steiner trees: A survey and experimental evaluation ⋮ On Steiner trees and minimum spanning trees in hypergraphs
This page was built for publication:
