The Steiner tree packing problem in VLSI design
type: Item
instance of: scholarly article
title: The Steiner tree packing problem in VLSI design
zbMATH Open document ID: 0889.90145
DOI: 10.1007/BF02614374
published in: Mathematical Programming. Series A. Series B
publication date: 1998-06-22T00:00:00Z
Mathematics Subject Classification ID: 90C35
Mathematics Subject Classification ID: 05C70
zbMATH DE Number: 1091313
zbMATH Keywords: routing
zbMATH Keywords: VLSI design
zbMATH Keywords: Steiner tree packing
zbMATH Keywords: switchbox routing
zbMATH Keywords: cutting plane
author: Martin Grötschel
author: Alexander Martin
author: Robert Weismantel
describes a project that uses: BEAVER
MaRDI profile type: Publication
cites work: The Rectilinear Steiner Tree Problem is $NP$-Complete
cites work: Integer Polyhedra Arising from Certain Network Design Problems with Connectivity Constraints
cites work: Packing Steiner trees: Polyhedral investigations
cites work: Packing Steiner trees: A cutting plane algorithm and computational results
cites work: Packing Steiner Trees: Separation Algorithms
cites work: Q3997942
cites work: Q4023738
Recommended article: Q3210200
Recommended article: Steiner tree packing revisited
Recommended article: Q4023738
Recommended article: Class Steiner trees and VLSI-design
Recommended article: Packing Steiner trees: Polyhedral investigations
Recommended article: Packing Steiner trees: Further facets
Recommended article: Q4471308
Recommended article: Packing Steiner trees
Recommended article: Packing the Steiner trees of a graph
Recommended article: Preprocessing Steiner problems from VLSI layout
description: scientific article; zbMATH DE number 1091313